./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0521.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/memsafety/test-0521.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 aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:38:38,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:38:38,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:38:38,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:38:38,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:38:38,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:38:38,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:38:38,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:38:38,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:38:38,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:38:38,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:38:38,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:38:38,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:38:38,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:38:38,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:38:38,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:38:38,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:38:38,169 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:38:38,170 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:38:38,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:38:38,177 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:38:38,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:38:38,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:38:38,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:38:38,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:38:38,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:38:38,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:38:38,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:38:38,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:38:38,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:38:38,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:38:38,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:38:38,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:38:38,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:38:38,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:38:38,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:38:38,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:38:38,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:38:38,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:38:38,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:38:38,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:38:38,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:38:38,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:38:38,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:38:38,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:38:38,230 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:38:38,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:38:38,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:38:38,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:38:38,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:38:38,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:38:38,232 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:38:38,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:38:38,233 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:38:38,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:38:38,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:38:38,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:38:38,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:38:38,234 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:38:38,234 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:38:38,234 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:38:38,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:38:38,236 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:38:38,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:38:38,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:38:38,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:38:38,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:38:38,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:38:38,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:38:38,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:38:38,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:38:38,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:38:38,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:38:38,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa94cb741c9c7eaa2ca9bb871f44dd4c619faf21975944b61e221a61ad9730d7 [2022-07-12 18:38:38,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:38:38,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:38:38,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:38:38,517 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:38:38,518 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:38:38,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0521.i [2022-07-12 18:38:38,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5c68e1/28408d5d7df84aa7b75a4f5e099df1a2/FLAG89faf6913 [2022-07-12 18:38:39,064 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:38:39,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0521.i [2022-07-12 18:38:39,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5c68e1/28408d5d7df84aa7b75a4f5e099df1a2/FLAG89faf6913 [2022-07-12 18:38:39,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07b5c68e1/28408d5d7df84aa7b75a4f5e099df1a2 [2022-07-12 18:38:39,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:38:39,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:38:39,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:38:39,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:38:39,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:38:39,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c0169a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39, skipping insertion in model container [2022-07-12 18:38:39,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:38:39,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:38:39,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:38:39,743 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:38:39,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:38:39,844 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:38:39,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39 WrapperNode [2022-07-12 18:38:39,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:38:39,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:38:39,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:38:39,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:38:39,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,907 INFO L137 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 305 [2022-07-12 18:38:39,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:38:39,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:38:39,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:38:39,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:38:39,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:38:39,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:38:39,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:38:39,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:38:39,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (1/1) ... [2022-07-12 18:38:39,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:38:39,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:39,995 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) [2022-07-12 18:38:40,008 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 [2022-07-12 18:38:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:38:40,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:38:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:38:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:38:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:38:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:38:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:38:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:38:40,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 18:38:40,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:38:40,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:38:40,216 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:38:40,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:38:40,947 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:38:40,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:38:40,959 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-12 18:38:40,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:38:40 BoogieIcfgContainer [2022-07-12 18:38:40,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:38:40,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:38:40,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:38:40,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:38:40,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:38:39" (1/3) ... [2022-07-12 18:38:40,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dae2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:38:40, skipping insertion in model container [2022-07-12 18:38:40,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:38:39" (2/3) ... [2022-07-12 18:38:40,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dae2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:38:40, skipping insertion in model container [2022-07-12 18:38:40,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:38:40" (3/3) ... [2022-07-12 18:38:40,972 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0521.i [2022-07-12 18:38:40,982 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:38:40,983 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2022-07-12 18:38:41,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:38:41,029 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52e04810, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5ef0154c [2022-07-12 18:38:41,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2022-07-12 18:38:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 18:38:41,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 18:38:41,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash 28729512, now seen corresponding path program 1 times [2022-07-12 18:38:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890174370] [2022-07-12 18:38:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890174370] [2022-07-12 18:38:41,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890174370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194044728] [2022-07-12 18:38:41,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 18:38:41,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 18:38:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:38:41,216 INFO L87 Difference]: Start difference. First operand has 313 states, 160 states have (on average 2.1875) internal successors, (350), 312 states have internal predecessors, (350), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:41,262 INFO L93 Difference]: Finished difference Result 313 states and 340 transitions. [2022-07-12 18:38:41,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 18:38:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-12 18:38:41,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:41,283 INFO L225 Difference]: With dead ends: 313 [2022-07-12 18:38:41,284 INFO L226 Difference]: Without dead ends: 311 [2022-07-12 18:38:41,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 18:38:41,288 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:41,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-07-12 18:38:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-07-12 18:38:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 159 states have (on average 2.1257861635220126) internal successors, (338), 310 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 338 transitions. [2022-07-12 18:38:41,355 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 338 transitions. Word has length 5 [2022-07-12 18:38:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:41,356 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 338 transitions. [2022-07-12 18:38:41,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2022-07-12 18:38:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:38:41,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:38:41,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:38:41,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2022-07-12 18:38:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950152439] [2022-07-12 18:38:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950152439] [2022-07-12 18:38:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950152439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920955380] [2022-07-12 18:38:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:41,433 INFO L87 Difference]: Start difference. First operand 311 states and 338 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:41,699 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2022-07-12 18:38:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:41,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:38:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:41,700 INFO L225 Difference]: With dead ends: 295 [2022-07-12 18:38:41,701 INFO L226 Difference]: Without dead ends: 295 [2022-07-12 18:38:41,701 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 [2022-07-12 18:38:41,702 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 77 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:41,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 406 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-12 18:38:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-07-12 18:38:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 294 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 322 transitions. [2022-07-12 18:38:41,712 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 322 transitions. Word has length 6 [2022-07-12 18:38:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:41,712 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 322 transitions. [2022-07-12 18:38:41,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2022-07-12 18:38:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:38:41,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:38:41,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:38:41,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash 889570249, now seen corresponding path program 1 times [2022-07-12 18:38:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255388415] [2022-07-12 18:38:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255388415] [2022-07-12 18:38:41,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255388415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34053980] [2022-07-12 18:38:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:41,778 INFO L87 Difference]: Start difference. First operand 295 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:41,948 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2022-07-12 18:38:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:41,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:38:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:41,950 INFO L225 Difference]: With dead ends: 279 [2022-07-12 18:38:41,950 INFO L226 Difference]: Without dead ends: 279 [2022-07-12 18:38:41,950 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 [2022-07-12 18:38:41,951 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:41,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 415 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-12 18:38:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-07-12 18:38:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 159 states have (on average 1.9245283018867925) internal successors, (306), 278 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2022-07-12 18:38:41,959 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 6 [2022-07-12 18:38:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:41,959 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2022-07-12 18:38:41,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2022-07-12 18:38:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:38:41,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:41,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:38:41,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:38:41,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-07-12 18:38:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:41,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541392335] [2022-07-12 18:38:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:41,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541392335] [2022-07-12 18:38:41,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541392335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:41,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:41,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697245797] [2022-07-12 18:38:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:41,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:41,988 INFO L87 Difference]: Start difference. First operand 279 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:42,193 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2022-07-12 18:38:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:38:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:42,195 INFO L225 Difference]: With dead ends: 334 [2022-07-12 18:38:42,195 INFO L226 Difference]: Without dead ends: 334 [2022-07-12 18:38:42,195 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 [2022-07-12 18:38:42,196 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:42,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 481 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-07-12 18:38:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 277. [2022-07-12 18:38:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 159 states have (on average 1.9119496855345912) internal successors, (304), 276 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2022-07-12 18:38:42,203 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 6 [2022-07-12 18:38:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:42,204 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2022-07-12 18:38:42,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2022-07-12 18:38:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:38:42,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:42,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:38:42,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:38:42,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-07-12 18:38:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:42,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527571795] [2022-07-12 18:38:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:42,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527571795] [2022-07-12 18:38:42,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527571795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:42,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:42,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043094490] [2022-07-12 18:38:42,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:42,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:42,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:42,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:42,246 INFO L87 Difference]: Start difference. First operand 277 states and 304 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:42,494 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2022-07-12 18:38:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:42,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-07-12 18:38:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:42,497 INFO L225 Difference]: With dead ends: 466 [2022-07-12 18:38:42,497 INFO L226 Difference]: Without dead ends: 466 [2022-07-12 18:38:42,497 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 [2022-07-12 18:38:42,498 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 220 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:42,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 579 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-07-12 18:38:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 275. [2022-07-12 18:38:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 159 states have (on average 1.89937106918239) internal successors, (302), 274 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2022-07-12 18:38:42,505 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 6 [2022-07-12 18:38:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:42,505 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2022-07-12 18:38:42,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2022-07-12 18:38:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:38:42,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:42,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:42,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:38:42,507 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash 178517033, now seen corresponding path program 1 times [2022-07-12 18:38:42,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082104253] [2022-07-12 18:38:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:42,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082104253] [2022-07-12 18:38:42,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082104253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:42,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:42,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285744532] [2022-07-12 18:38:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:42,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:38:42,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:38:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:38:42,569 INFO L87 Difference]: Start difference. First operand 275 states and 302 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:42,624 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2022-07-12 18:38:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:38:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:38:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:42,627 INFO L225 Difference]: With dead ends: 678 [2022-07-12 18:38:42,627 INFO L226 Difference]: Without dead ends: 678 [2022-07-12 18:38:42,627 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 [2022-07-12 18:38:42,628 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 597 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:42,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 870 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-12 18:38:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 280. [2022-07-12 18:38:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 164 states have (on average 1.8780487804878048) internal successors, (308), 279 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2022-07-12 18:38:42,636 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 8 [2022-07-12 18:38:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:42,636 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2022-07-12 18:38:42,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2022-07-12 18:38:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:38:42,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:42,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:42,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:38:42,638 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660206, now seen corresponding path program 1 times [2022-07-12 18:38:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:42,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048916347] [2022-07-12 18:38:42,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:42,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:42,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048916347] [2022-07-12 18:38:42,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048916347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:42,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:42,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250879969] [2022-07-12 18:38:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:42,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:42,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:42,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:42,689 INFO L87 Difference]: Start difference. First operand 280 states and 308 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-07-12 18:38:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:42,874 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2022-07-12 18:38:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 [2022-07-12 18:38:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:42,876 INFO L225 Difference]: With dead ends: 330 [2022-07-12 18:38:42,876 INFO L226 Difference]: Without dead ends: 330 [2022-07-12 18:38:42,877 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 [2022-07-12 18:38:42,878 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 72 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:42,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 476 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-12 18:38:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 278. [2022-07-12 18:38:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 164 states have (on average 1.8658536585365855) internal successors, (306), 277 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2022-07-12 18:38:42,883 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 11 [2022-07-12 18:38:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:42,884 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2022-07-12 18:38:42,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-07-12 18:38:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2022-07-12 18:38:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:38:42,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:42,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:42,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:38:42,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660205, now seen corresponding path program 1 times [2022-07-12 18:38:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:42,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523443198] [2022-07-12 18:38:42,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:42,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:42,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:42,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523443198] [2022-07-12 18:38:42,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523443198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:42,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:42,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:42,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795794977] [2022-07-12 18:38:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:42,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:42,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:42,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:42,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:42,938 INFO L87 Difference]: Start difference. First operand 278 states and 306 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-07-12 18:38:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,158 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2022-07-12 18:38:43,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:43,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 [2022-07-12 18:38:43,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,160 INFO L225 Difference]: With dead ends: 462 [2022-07-12 18:38:43,160 INFO L226 Difference]: Without dead ends: 462 [2022-07-12 18:38:43,161 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 [2022-07-12 18:38:43,161 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 216 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 574 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-07-12 18:38:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 276. [2022-07-12 18:38:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 164 states have (on average 1.853658536585366) internal successors, (304), 275 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2022-07-12 18:38:43,166 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 11 [2022-07-12 18:38:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,167 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2022-07-12 18:38:43,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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) [2022-07-12 18:38:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2022-07-12 18:38:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:38:43,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:38:43,176 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1231388841, now seen corresponding path program 1 times [2022-07-12 18:38:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:43,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423151370] [2022-07-12 18:38:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:43,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423151370] [2022-07-12 18:38:43,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423151370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:43,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:43,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:38:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156595028] [2022-07-12 18:38:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:43,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:38:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:38:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:38:43,272 INFO L87 Difference]: Start difference. First operand 276 states and 304 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,450 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2022-07-12 18:38:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:38:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 18:38:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,454 INFO L225 Difference]: With dead ends: 666 [2022-07-12 18:38:43,454 INFO L226 Difference]: Without dead ends: 666 [2022-07-12 18:38:43,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:38:43,455 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 576 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1363 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-07-12 18:38:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 279. [2022-07-12 18:38:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 167 states have (on average 1.8383233532934131) internal successors, (307), 278 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2022-07-12 18:38:43,463 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 13 [2022-07-12 18:38:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,463 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2022-07-12 18:38:43,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2022-07-12 18:38:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:38:43,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:38:43,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2035528525, now seen corresponding path program 1 times [2022-07-12 18:38:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:43,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216161017] [2022-07-12 18:38:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:43,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216161017] [2022-07-12 18:38:43,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216161017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:43,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:43,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:38:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402397194] [2022-07-12 18:38:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:43,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:43,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:43,515 INFO L87 Difference]: Start difference. First operand 279 states and 307 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,589 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2022-07-12 18:38:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:38:43,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-12 18:38:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,592 INFO L225 Difference]: With dead ends: 408 [2022-07-12 18:38:43,592 INFO L226 Difference]: Without dead ends: 408 [2022-07-12 18:38:43,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:38:43,593 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 237 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1120 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-12 18:38:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 343. [2022-07-12 18:38:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 231 states have (on average 1.8831168831168832) internal successors, (435), 342 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 435 transitions. [2022-07-12 18:38:43,600 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 435 transitions. Word has length 15 [2022-07-12 18:38:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,600 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 435 transitions. [2022-07-12 18:38:43,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 435 transitions. [2022-07-12 18:38:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:38:43,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:38:43,602 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1316385230, now seen corresponding path program 1 times [2022-07-12 18:38:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968483383] [2022-07-12 18:38:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:43,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968483383] [2022-07-12 18:38:43,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968483383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:43,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:43,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:38:43,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760146749] [2022-07-12 18:38:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:43,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:43,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:43,629 INFO L87 Difference]: Start difference. First operand 343 states and 435 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2022-07-12 18:38:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,641 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2022-07-12 18:38:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:43,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 [2022-07-12 18:38:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,643 INFO L225 Difference]: With dead ends: 328 [2022-07-12 18:38:43,643 INFO L226 Difference]: Without dead ends: 328 [2022-07-12 18:38:43,643 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 [2022-07-12 18:38:43,644 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 223 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 363 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-07-12 18:38:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-07-12 18:38:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 216 states have (on average 1.8981481481481481) internal successors, (410), 327 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2022-07-12 18:38:43,650 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 16 [2022-07-12 18:38:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,650 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2022-07-12 18:38:43,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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) [2022-07-12 18:38:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2022-07-12 18:38:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:38:43,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:38:43,652 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989585, now seen corresponding path program 1 times [2022-07-12 18:38:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:43,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071207578] [2022-07-12 18:38:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:43,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071207578] [2022-07-12 18:38:43,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071207578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:43,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:43,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:43,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137049462] [2022-07-12 18:38:43,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:43,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:43,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:43,677 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2022-07-12 18:38:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,797 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2022-07-12 18:38:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 [2022-07-12 18:38:43,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,799 INFO L225 Difference]: With dead ends: 312 [2022-07-12 18:38:43,799 INFO L226 Difference]: Without dead ends: 312 [2022-07-12 18:38:43,799 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 [2022-07-12 18:38:43,800 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 346 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-07-12 18:38:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-07-12 18:38:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 216 states have (on average 1.75) internal successors, (378), 311 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2022-07-12 18:38:43,805 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 378 transitions. Word has length 17 [2022-07-12 18:38:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,806 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 378 transitions. [2022-07-12 18:38:43,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2022-07-12 18:38:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2022-07-12 18:38:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:38:43,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:38:43,807 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989586, now seen corresponding path program 1 times [2022-07-12 18:38:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700540517] [2022-07-12 18:38:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:43,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700540517] [2022-07-12 18:38:43,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700540517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:43,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:43,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:38:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383664570] [2022-07-12 18:38:43,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:43,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:43,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:43,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:43,838 INFO L87 Difference]: Start difference. First operand 312 states and 378 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2022-07-12 18:38:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:43,969 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-07-12 18:38:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:43,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 [2022-07-12 18:38:43,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:43,971 INFO L225 Difference]: With dead ends: 296 [2022-07-12 18:38:43,971 INFO L226 Difference]: Without dead ends: 296 [2022-07-12 18:38:43,971 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 [2022-07-12 18:38:43,971 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:43,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 355 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-12 18:38:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-07-12 18:38:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 295 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2022-07-12 18:38:43,977 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 17 [2022-07-12 18:38:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:43,978 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2022-07-12 18:38:43,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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) [2022-07-12 18:38:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-07-12 18:38:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:38:43,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:43,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:43,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:38:43,980 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2117838446, now seen corresponding path program 1 times [2022-07-12 18:38:43,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:43,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304059947] [2022-07-12 18:38:43,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:43,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:44,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:44,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304059947] [2022-07-12 18:38:44,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304059947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:44,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:44,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:38:44,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211663024] [2022-07-12 18:38:44,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:44,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:44,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:44,051 INFO L87 Difference]: Start difference. First operand 296 states and 346 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:44,141 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2022-07-12 18:38:44,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:38:44,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-12 18:38:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:44,143 INFO L225 Difference]: With dead ends: 394 [2022-07-12 18:38:44,143 INFO L226 Difference]: Without dead ends: 394 [2022-07-12 18:38:44,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:44,144 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 277 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:44,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 994 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-07-12 18:38:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2022-07-12 18:38:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 213 states have (on average 1.596244131455399) internal successors, (340), 292 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 340 transitions. [2022-07-12 18:38:44,152 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 340 transitions. Word has length 19 [2022-07-12 18:38:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:44,153 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 340 transitions. [2022-07-12 18:38:44,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 340 transitions. [2022-07-12 18:38:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:38:44,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:44,154 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:44,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:38:44,155 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279430, now seen corresponding path program 1 times [2022-07-12 18:38:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:44,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554795403] [2022-07-12 18:38:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:44,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:44,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554795403] [2022-07-12 18:38:44,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554795403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:44,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:44,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:38:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903424391] [2022-07-12 18:38:44,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:44,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:38:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:38:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:38:44,238 INFO L87 Difference]: Start difference. First operand 293 states and 340 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:44,481 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2022-07-12 18:38:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:38:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-12 18:38:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:44,483 INFO L225 Difference]: With dead ends: 316 [2022-07-12 18:38:44,483 INFO L226 Difference]: Without dead ends: 316 [2022-07-12 18:38:44,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:44,484 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 271 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:44,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 557 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-12 18:38:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2022-07-12 18:38:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 217 states have (on average 1.5898617511520738) internal successors, (345), 294 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2022-07-12 18:38:44,489 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 19 [2022-07-12 18:38:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:44,489 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2022-07-12 18:38:44,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2022-07-12 18:38:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:38:44,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:44,490 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:38:44,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:38:44,490 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279429, now seen corresponding path program 1 times [2022-07-12 18:38:44,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:44,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563251460] [2022-07-12 18:38:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:44,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563251460] [2022-07-12 18:38:44,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563251460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:44,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:44,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151022555] [2022-07-12 18:38:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:44,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:44,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:44,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:44,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:44,562 INFO L87 Difference]: Start difference. First operand 295 states and 345 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:44,875 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2022-07-12 18:38:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:38:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-12 18:38:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:44,877 INFO L225 Difference]: With dead ends: 409 [2022-07-12 18:38:44,877 INFO L226 Difference]: Without dead ends: 409 [2022-07-12 18:38:44,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:44,878 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 437 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:44,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 647 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:38:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-12 18:38:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 294. [2022-07-12 18:38:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 293 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2022-07-12 18:38:44,886 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 19 [2022-07-12 18:38:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:44,886 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2022-07-12 18:38:44,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2022-07-12 18:38:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:38:44,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:44,890 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] [2022-07-12 18:38:44,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:38:44,890 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:44,891 INFO L85 PathProgramCache]: Analyzing trace with hash -805519643, now seen corresponding path program 1 times [2022-07-12 18:38:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:44,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109297639] [2022-07-12 18:38:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:44,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:44,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109297639] [2022-07-12 18:38:44,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109297639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:44,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:44,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:38:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856409820] [2022-07-12 18:38:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:38:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:38:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:38:44,973 INFO L87 Difference]: Start difference. First operand 294 states and 344 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) [2022-07-12 18:38:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:45,198 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2022-07-12 18:38:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:38:45,198 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 [2022-07-12 18:38:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:45,200 INFO L225 Difference]: With dead ends: 394 [2022-07-12 18:38:45,200 INFO L226 Difference]: Without dead ends: 394 [2022-07-12 18:38:45,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:38:45,200 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 251 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:45,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1409 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-07-12 18:38:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 280. [2022-07-12 18:38:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5812807881773399) internal successors, (321), 279 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 321 transitions. [2022-07-12 18:38:45,204 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 321 transitions. Word has length 24 [2022-07-12 18:38:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:45,204 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 321 transitions. [2022-07-12 18:38:45,205 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) [2022-07-12 18:38:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 321 transitions. [2022-07-12 18:38:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 18:38:45,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:45,205 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] [2022-07-12 18:38:45,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:38:45,205 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:45,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1972902682, now seen corresponding path program 1 times [2022-07-12 18:38:45,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:45,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945861371] [2022-07-12 18:38:45,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:45,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945861371] [2022-07-12 18:38:45,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945861371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:45,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:45,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:38:45,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348520320] [2022-07-12 18:38:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:45,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:45,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:45,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:45,262 INFO L87 Difference]: Start difference. First operand 280 states and 321 transitions. Second operand has 5 states, 5 states have (on average 4.8) 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) [2022-07-12 18:38:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:45,312 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-07-12 18:38:45,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:38:45,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) 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 [2022-07-12 18:38:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:45,314 INFO L225 Difference]: With dead ends: 298 [2022-07-12 18:38:45,314 INFO L226 Difference]: Without dead ends: 298 [2022-07-12 18:38:45,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:45,314 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 667 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:45,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 560 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-07-12 18:38:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2022-07-12 18:38:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 203 states have (on average 1.5763546798029557) internal successors, (320), 279 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2022-07-12 18:38:45,319 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 24 [2022-07-12 18:38:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:45,319 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2022-07-12 18:38:45,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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) [2022-07-12 18:38:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2022-07-12 18:38:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:38:45,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:45,320 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] [2022-07-12 18:38:45,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:38:45,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:45,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1021020451, now seen corresponding path program 1 times [2022-07-12 18:38:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:45,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870263913] [2022-07-12 18:38:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:45,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870263913] [2022-07-12 18:38:45,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870263913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:45,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:45,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351388351] [2022-07-12 18:38:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:45,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:45,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:45,390 INFO L87 Difference]: Start difference. First operand 280 states and 320 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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) [2022-07-12 18:38:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:45,622 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2022-07-12 18:38:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:38:45,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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 [2022-07-12 18:38:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:45,624 INFO L225 Difference]: With dead ends: 288 [2022-07-12 18:38:45,624 INFO L226 Difference]: Without dead ends: 284 [2022-07-12 18:38:45,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:45,625 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 26 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:45,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 663 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-12 18:38:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2022-07-12 18:38:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 277 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2022-07-12 18:38:45,629 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 26 [2022-07-12 18:38:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:45,630 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2022-07-12 18:38:45,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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) [2022-07-12 18:38:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2022-07-12 18:38:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:38:45,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:45,630 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] [2022-07-12 18:38:45,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 18:38:45,631 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:45,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1580222949, now seen corresponding path program 1 times [2022-07-12 18:38:45,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:45,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562627371] [2022-07-12 18:38:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:45,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562627371] [2022-07-12 18:38:45,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562627371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:45,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:45,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:38:45,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430933671] [2022-07-12 18:38:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:45,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:38:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:45,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:38:45,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:38:45,658 INFO L87 Difference]: Start difference. First operand 278 states and 317 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:45,667 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2022-07-12 18:38:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:38:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:38:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:45,669 INFO L225 Difference]: With dead ends: 263 [2022-07-12 18:38:45,669 INFO L226 Difference]: Without dead ends: 245 [2022-07-12 18:38:45,669 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 [2022-07-12 18:38:45,670 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 31 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:45,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 485 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:38:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-12 18:38:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-07-12 18:38:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 168 states have (on average 1.630952380952381) internal successors, (274), 244 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-07-12 18:38:45,674 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 27 [2022-07-12 18:38:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:45,674 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-07-12 18:38:45,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-07-12 18:38:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:38:45,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:45,675 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] [2022-07-12 18:38:45,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 18:38:45,676 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:45,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:45,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321696, now seen corresponding path program 1 times [2022-07-12 18:38:45,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:45,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430604654] [2022-07-12 18:38:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:45,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:45,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430604654] [2022-07-12 18:38:45,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430604654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:45,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:45,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:38:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138665248] [2022-07-12 18:38:45,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:45,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:38:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:38:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:38:45,828 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:46,579 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2022-07-12 18:38:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:38:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:38:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:46,581 INFO L225 Difference]: With dead ends: 251 [2022-07-12 18:38:46,581 INFO L226 Difference]: Without dead ends: 251 [2022-07-12 18:38:46,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:38:46,582 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 257 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:46,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1314 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:38:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-12 18:38:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2022-07-12 18:38:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 168 states have (on average 1.625) internal successors, (273), 243 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2022-07-12 18:38:46,586 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 27 [2022-07-12 18:38:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:46,586 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2022-07-12 18:38:46,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2022-07-12 18:38:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:38:46,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:46,586 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] [2022-07-12 18:38:46,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 18:38:46,587 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:46,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:46,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321697, now seen corresponding path program 1 times [2022-07-12 18:38:46,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:46,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464892085] [2022-07-12 18:38:46,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:46,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:46,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464892085] [2022-07-12 18:38:46,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464892085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:46,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:46,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:38:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722037879] [2022-07-12 18:38:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:46,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:38:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:38:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:38:46,856 INFO L87 Difference]: Start difference. First operand 244 states and 273 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:48,177 INFO L93 Difference]: Finished difference Result 504 states and 573 transitions. [2022-07-12 18:38:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:38:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:38:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:48,180 INFO L225 Difference]: With dead ends: 504 [2022-07-12 18:38:48,180 INFO L226 Difference]: Without dead ends: 504 [2022-07-12 18:38:48,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:38:48,181 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 673 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:48,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1864 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 18:38:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-12 18:38:48,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 243. [2022-07-12 18:38:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.619047619047619) internal successors, (272), 242 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2022-07-12 18:38:48,186 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 27 [2022-07-12 18:38:48,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:48,186 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2022-07-12 18:38:48,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2022-07-12 18:38:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:38:48,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:48,187 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] [2022-07-12 18:38:48,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 18:38:48,187 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -672116074, now seen corresponding path program 1 times [2022-07-12 18:38:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142304914] [2022-07-12 18:38:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:48,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142304914] [2022-07-12 18:38:48,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142304914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:48,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:48,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:38:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516392564] [2022-07-12 18:38:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:48,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:38:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:38:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:48,251 INFO L87 Difference]: Start difference. First operand 243 states and 272 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:48,445 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2022-07-12 18:38:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:38:48,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 18:38:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:48,446 INFO L225 Difference]: With dead ends: 265 [2022-07-12 18:38:48,447 INFO L226 Difference]: Without dead ends: 265 [2022-07-12 18:38:48,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:38:48,447 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 725 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:48,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 934 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:38:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-12 18:38:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2022-07-12 18:38:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 168 states have (on average 1.6130952380952381) internal successors, (271), 242 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2022-07-12 18:38:48,452 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 29 [2022-07-12 18:38:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:48,452 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2022-07-12 18:38:48,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2022-07-12 18:38:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:38:48,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:48,452 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] [2022-07-12 18:38:48,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 18:38:48,453 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 102015914, now seen corresponding path program 1 times [2022-07-12 18:38:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:48,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661272456] [2022-07-12 18:38:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:38:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:48,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661272456] [2022-07-12 18:38:48,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661272456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:48,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:48,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:38:48,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422809257] [2022-07-12 18:38:48,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:48,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:38:48,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:48,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:38:48,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:38:48,500 INFO L87 Difference]: Start difference. First operand 243 states and 271 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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) [2022-07-12 18:38:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:48,707 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2022-07-12 18:38:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:38:48,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 31 [2022-07-12 18:38:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:48,708 INFO L225 Difference]: With dead ends: 259 [2022-07-12 18:38:48,708 INFO L226 Difference]: Without dead ends: 259 [2022-07-12 18:38:48,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:38:48,709 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 51 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:48,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 673 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:38:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-12 18:38:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 242. [2022-07-12 18:38:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 241 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-07-12 18:38:48,713 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 31 [2022-07-12 18:38:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:48,713 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-07-12 18:38:48,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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) [2022-07-12 18:38:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-07-12 18:38:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 18:38:48,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:48,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, 1, 1, 1] [2022-07-12 18:38:48,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 18:38:48,714 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 102015915, now seen corresponding path program 1 times [2022-07-12 18:38:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:48,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810049629] [2022-07-12 18:38:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:48,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810049629] [2022-07-12 18:38:48,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810049629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:48,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:48,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:38:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812463180] [2022-07-12 18:38:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:48,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:38:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:48,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:38:48,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:38:48,861 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:49,406 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2022-07-12 18:38:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:38:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 18:38:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:49,408 INFO L225 Difference]: With dead ends: 374 [2022-07-12 18:38:49,408 INFO L226 Difference]: Without dead ends: 374 [2022-07-12 18:38:49,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:38:49,410 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 542 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:49,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 947 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:38:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-12 18:38:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 241. [2022-07-12 18:38:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.6011904761904763) internal successors, (269), 240 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2022-07-12 18:38:49,414 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 31 [2022-07-12 18:38:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:49,414 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2022-07-12 18:38:49,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2022-07-12 18:38:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:38:49,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:49,415 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] [2022-07-12 18:38:49,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 18:38:49,415 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778921, now seen corresponding path program 1 times [2022-07-12 18:38:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:49,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53204023] [2022-07-12 18:38:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:49,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53204023] [2022-07-12 18:38:49,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53204023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:49,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:49,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:38:49,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728997168] [2022-07-12 18:38:49,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:49,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:38:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:38:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:38:49,520 INFO L87 Difference]: Start difference. First operand 241 states and 269 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:49,897 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2022-07-12 18:38:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:38:49,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 18:38:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:49,900 INFO L225 Difference]: With dead ends: 398 [2022-07-12 18:38:49,900 INFO L226 Difference]: Without dead ends: 398 [2022-07-12 18:38:49,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:38:49,900 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 580 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:49,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 614 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:38:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-07-12 18:38:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2022-07-12 18:38:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 173 states have (on average 1.5953757225433527) internal successors, (276), 243 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2022-07-12 18:38:49,906 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 34 [2022-07-12 18:38:49,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:49,906 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2022-07-12 18:38:49,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2022-07-12 18:38:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:38:49,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:49,907 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] [2022-07-12 18:38:49,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 18:38:49,907 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:49,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778920, now seen corresponding path program 1 times [2022-07-12 18:38:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:49,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815155802] [2022-07-12 18:38:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:49,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815155802] [2022-07-12 18:38:49,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815155802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:49,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:49,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:38:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217865610] [2022-07-12 18:38:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:49,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:38:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:38:49,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:38:49,998 INFO L87 Difference]: Start difference. First operand 244 states and 276 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:50,518 INFO L93 Difference]: Finished difference Result 496 states and 560 transitions. [2022-07-12 18:38:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:38:50,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 18:38:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:50,520 INFO L225 Difference]: With dead ends: 496 [2022-07-12 18:38:50,520 INFO L226 Difference]: Without dead ends: 496 [2022-07-12 18:38:50,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:38:50,521 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 712 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:50,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 715 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:38:50,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-07-12 18:38:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 308. [2022-07-12 18:38:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 307 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2022-07-12 18:38:50,527 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 34 [2022-07-12 18:38:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:50,527 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2022-07-12 18:38:50,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2022-07-12 18:38:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:38:50,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:50,528 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] [2022-07-12 18:38:50,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 18:38:50,528 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:50,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:50,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1332799064, now seen corresponding path program 1 times [2022-07-12 18:38:50,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:50,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431556730] [2022-07-12 18:38:50,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:50,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:50,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431556730] [2022-07-12 18:38:50,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431556730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:38:50,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:38:50,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 18:38:50,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138056375] [2022-07-12 18:38:50,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:38:50,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 18:38:50,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:38:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 18:38:50,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:38:50,806 INFO L87 Difference]: Start difference. First operand 308 states and 373 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 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) [2022-07-12 18:38:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:38:51,739 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2022-07-12 18:38:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:38:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 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 [2022-07-12 18:38:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:38:51,740 INFO L225 Difference]: With dead ends: 310 [2022-07-12 18:38:51,740 INFO L226 Difference]: Without dead ends: 310 [2022-07-12 18:38:51,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-07-12 18:38:51,741 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 293 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:38:51,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1865 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:38:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-12 18:38:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2022-07-12 18:38:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.5696202531645569) internal successors, (372), 307 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:38:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 372 transitions. [2022-07-12 18:38:51,746 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 372 transitions. Word has length 35 [2022-07-12 18:38:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:38:51,747 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 372 transitions. [2022-07-12 18:38:51,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 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) [2022-07-12 18:38:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 372 transitions. [2022-07-12 18:38:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:38:51,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:38:51,747 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] [2022-07-12 18:38:51,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 18:38:51,747 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:38:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:38:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash -561839822, now seen corresponding path program 1 times [2022-07-12 18:38:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:38:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867393546] [2022-07-12 18:38:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:38:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:51,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:38:51,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867393546] [2022-07-12 18:38:51,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867393546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:38:51,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089061885] [2022-07-12 18:38:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:38:51,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:38:51,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:38:51,979 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) [2022-07-12 18:38:51,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 18:38:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:38:52,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 18:38:52,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:38:52,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:38:52,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:38:52,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:38:52,328 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:38:52,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 18:38:52,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 18:38:52,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:38:52,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:52,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 18:38:52,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:52,423 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 18:38:52,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-07-12 18:38:52,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:52,501 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 18:38:52,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-07-12 18:38:52,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:38:52,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 18:38:52,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:38:52,590 INFO L356 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-07-12 18:38:52,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2022-07-12 18:38:52,598 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 18:38:52,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-12 18:38:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:38:52,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:05,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:05,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089061885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:05,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:05,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 22 [2022-07-12 18:39:05,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726984628] [2022-07-12 18:39:05,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:05,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 18:39:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:05,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 18:39:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=397, Unknown=4, NotChecked=0, Total=462 [2022-07-12 18:39:05,271 INFO L87 Difference]: Start difference. First operand 308 states and 372 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:05,765 INFO L93 Difference]: Finished difference Result 341 states and 406 transitions. [2022-07-12 18:39:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:39:05,765 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 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 [2022-07-12 18:39:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:05,767 INFO L225 Difference]: With dead ends: 341 [2022-07-12 18:39:05,767 INFO L226 Difference]: Without dead ends: 341 [2022-07-12 18:39:05,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=102, Invalid=596, Unknown=4, NotChecked=0, Total=702 [2022-07-12 18:39:05,768 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 26 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2782 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 684 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:05,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2782 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 554 Invalid, 0 Unknown, 684 Unchecked, 0.4s Time] [2022-07-12 18:39:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-12 18:39:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2022-07-12 18:39:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.5112781954887218) internal successors, (402), 336 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 402 transitions. [2022-07-12 18:39:05,773 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 402 transitions. Word has length 35 [2022-07-12 18:39:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:05,773 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 402 transitions. [2022-07-12 18:39:05,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 402 transitions. [2022-07-12 18:39:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:39:05,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:05,774 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] [2022-07-12 18:39:05,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:39:05,999 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,SelfDestructingSolverStorable28 [2022-07-12 18:39:05,999 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:39:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:06,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2034656951, now seen corresponding path program 1 times [2022-07-12 18:39:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:06,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640568380] [2022-07-12 18:39:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:39:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:06,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640568380] [2022-07-12 18:39:06,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640568380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:39:06,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:39:06,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:39:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247810662] [2022-07-12 18:39:06,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:39:06,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:39:06,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:06,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:39:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:39:06,091 INFO L87 Difference]: Start difference. First operand 337 states and 402 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:06,245 INFO L93 Difference]: Finished difference Result 343 states and 409 transitions. [2022-07-12 18:39:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:39:06,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 [2022-07-12 18:39:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:06,247 INFO L225 Difference]: With dead ends: 343 [2022-07-12 18:39:06,247 INFO L226 Difference]: Without dead ends: 343 [2022-07-12 18:39:06,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:39:06,248 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 2 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:06,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 845 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:39:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-12 18:39:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-07-12 18:39:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 270 states have (on average 1.5074074074074073) internal successors, (407), 340 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 407 transitions. [2022-07-12 18:39:06,255 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 407 transitions. Word has length 40 [2022-07-12 18:39:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:06,255 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 407 transitions. [2022-07-12 18:39:06,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 407 transitions. [2022-07-12 18:39:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 18:39:06,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:06,256 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, 1] [2022-07-12 18:39:06,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 18:39:06,256 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:39:06,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash 854914797, now seen corresponding path program 1 times [2022-07-12 18:39:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:06,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776939671] [2022-07-12 18:39:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:06,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776939671] [2022-07-12 18:39:06,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776939671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:39:06,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:39:06,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:39:06,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639717017] [2022-07-12 18:39:06,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:39:06,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:39:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:39:06,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:39:06,349 INFO L87 Difference]: Start difference. First operand 341 states and 407 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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) [2022-07-12 18:39:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:06,572 INFO L93 Difference]: Finished difference Result 461 states and 515 transitions. [2022-07-12 18:39:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:39:06,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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 43 [2022-07-12 18:39:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:06,574 INFO L225 Difference]: With dead ends: 461 [2022-07-12 18:39:06,574 INFO L226 Difference]: Without dead ends: 461 [2022-07-12 18:39:06,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:39:06,574 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 1409 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:06,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 956 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:39:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-12 18:39:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 340. [2022-07-12 18:39:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 269 states have (on average 1.4981412639405205) internal successors, (403), 339 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 403 transitions. [2022-07-12 18:39:06,580 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 403 transitions. Word has length 43 [2022-07-12 18:39:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:06,580 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 403 transitions. [2022-07-12 18:39:06,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 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) [2022-07-12 18:39:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 403 transitions. [2022-07-12 18:39:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:39:06,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:06,581 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, 1, 1, 1] [2022-07-12 18:39:06,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 18:39:06,581 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:39:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash 190981616, now seen corresponding path program 1 times [2022-07-12 18:39:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476333638] [2022-07-12 18:39:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 18:39:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:06,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476333638] [2022-07-12 18:39:06,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476333638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:39:06,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:39:06,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:39:06,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952062411] [2022-07-12 18:39:06,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:39:06,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:39:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:06,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:39:06,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:39:06,642 INFO L87 Difference]: Start difference. First operand 340 states and 403 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:06,896 INFO L93 Difference]: Finished difference Result 445 states and 521 transitions. [2022-07-12 18:39:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:39:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-12 18:39:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:06,897 INFO L225 Difference]: With dead ends: 445 [2022-07-12 18:39:06,898 INFO L226 Difference]: Without dead ends: 445 [2022-07-12 18:39:06,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:39:06,899 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 359 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:06,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 421 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:39:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-12 18:39:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 344. [2022-07-12 18:39:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.4945054945054945) internal successors, (408), 343 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 408 transitions. [2022-07-12 18:39:06,906 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 408 transitions. Word has length 45 [2022-07-12 18:39:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:06,906 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 408 transitions. [2022-07-12 18:39:06,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 408 transitions. [2022-07-12 18:39:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:39:06,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:06,907 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, 1, 1, 1] [2022-07-12 18:39:06,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 18:39:06,907 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:39:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash 190981617, now seen corresponding path program 1 times [2022-07-12 18:39:06,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:06,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270604556] [2022-07-12 18:39:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:06,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:07,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270604556] [2022-07-12 18:39:07,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270604556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:39:07,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:39:07,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 18:39:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927835172] [2022-07-12 18:39:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:39:07,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:39:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:39:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:39:07,072 INFO L87 Difference]: Start difference. First operand 344 states and 408 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:07,712 INFO L93 Difference]: Finished difference Result 371 states and 438 transitions. [2022-07-12 18:39:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:39:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-07-12 18:39:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:07,714 INFO L225 Difference]: With dead ends: 371 [2022-07-12 18:39:07,714 INFO L226 Difference]: Without dead ends: 367 [2022-07-12 18:39:07,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:39:07,715 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 414 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:07,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1894 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:39:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-12 18:39:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 345. [2022-07-12 18:39:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.489051094890511) internal successors, (408), 344 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 408 transitions. [2022-07-12 18:39:07,720 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 408 transitions. Word has length 45 [2022-07-12 18:39:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:07,720 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 408 transitions. [2022-07-12 18:39:07,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 408 transitions. [2022-07-12 18:39:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:39:07,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:07,721 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:07,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 18:39:07,721 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:39:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 767246721, now seen corresponding path program 2 times [2022-07-12 18:39:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:07,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119922716] [2022-07-12 18:39:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:08,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:08,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119922716] [2022-07-12 18:39:08,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119922716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:08,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307200706] [2022-07-12 18:39:08,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:39:08,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:08,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:08,240 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) [2022-07-12 18:39:08,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 18:39:08,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:39:08,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:39:08,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 18:39:08,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:08,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:39:08,453 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:39:08,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 18:39:08,493 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:39:08,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 18:39:08,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:39:08,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:08,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2022-07-12 18:39:08,728 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-12 18:39:08,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 45 [2022-07-12 18:39:08,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:08,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 47 treesize of output 37 [2022-07-12 18:39:08,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:39:08,956 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:39:08,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:39:08,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:08,982 INFO L356 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2022-07-12 18:39:08,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 54 [2022-07-12 18:39:09,368 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:39:09,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:39:09,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:09,395 INFO L356 Elim1Store]: treesize reduction 108, result has 12.2 percent of original size [2022-07-12 18:39:09,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 80 treesize of output 56 [2022-07-12 18:39:09,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:39:09,635 INFO L356 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-07-12 18:39:09,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 45 [2022-07-12 18:39:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:09,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-07-12 18:39:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:09,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:14,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:16,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307200706] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:39:16,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:39:16,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 53 [2022-07-12 18:39:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764391208] [2022-07-12 18:39:16,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:39:16,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-12 18:39:16,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:39:16,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-12 18:39:16,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2670, Unknown=1, NotChecked=0, Total=2862 [2022-07-12 18:39:16,505 INFO L87 Difference]: Start difference. First operand 345 states and 408 transitions. Second operand has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 54 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:39:19,166 INFO L93 Difference]: Finished difference Result 631 states and 756 transitions. [2022-07-12 18:39:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:39:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 54 states have internal predecessors, (104), 0 states have call successors, (0), 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 46 [2022-07-12 18:39:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:39:19,168 INFO L225 Difference]: With dead ends: 631 [2022-07-12 18:39:19,168 INFO L226 Difference]: Without dead ends: 631 [2022-07-12 18:39:19,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=709, Invalid=4546, Unknown=1, NotChecked=0, Total=5256 [2022-07-12 18:39:19,169 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 486 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1495 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:39:19,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 4103 Invalid, 4014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2452 Invalid, 0 Unknown, 1495 Unchecked, 1.1s Time] [2022-07-12 18:39:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-07-12 18:39:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 344. [2022-07-12 18:39:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 274 states have (on average 1.4854014598540146) internal successors, (407), 343 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 407 transitions. [2022-07-12 18:39:19,175 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 407 transitions. Word has length 46 [2022-07-12 18:39:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:39:19,175 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 407 transitions. [2022-07-12 18:39:19,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 54 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:39:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 407 transitions. [2022-07-12 18:39:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:39:19,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:39:19,176 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:39:19,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 18:39:19,400 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,SelfDestructingSolverStorable33 [2022-07-12 18:39:19,400 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:39:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:39:19,400 INFO L85 PathProgramCache]: Analyzing trace with hash 767246722, now seen corresponding path program 1 times [2022-07-12 18:39:19,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:39:19,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067545681] [2022-07-12 18:39:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:19,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:39:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:19,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:39:19,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067545681] [2022-07-12 18:39:19,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067545681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:39:19,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953011866] [2022-07-12 18:39:19,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:39:19,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:39:19,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:39:19,975 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) [2022-07-12 18:39:19,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 18:39:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:39:20,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 18:39:20,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:39:20,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:39:20,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:20,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:39:20,267 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:39:20,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 18:39:20,372 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:39:20,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 18:39:20,398 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 18:39:20,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 18:39:20,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:39:20,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2022-07-12 18:39:20,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:20,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:39:20,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:20,711 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 18:39:20,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 21 [2022-07-12 18:39:20,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-07-12 18:39:20,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 18:39:20,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:20,863 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 18:39:20,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 52 [2022-07-12 18:39:20,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:20,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 18:39:20,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:20,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 18:39:21,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:39:21,014 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 18:39:21,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 52 [2022-07-12 18:39:21,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:21,168 INFO L356 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-07-12 18:39:21,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 67 [2022-07-12 18:39:21,177 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 18:39:21,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-07-12 18:39:21,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 18:39:21,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2022-07-12 18:39:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:39:21,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:39:49,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:49,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:39:57,837 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:40:05,377 WARN L233 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:40:05,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 544 [2022-07-12 18:40:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:40:10,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953011866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:40:10,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:40:10,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 44 [2022-07-12 18:40:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135984275] [2022-07-12 18:40:10,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:40:10,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 18:40:10,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:40:10,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 18:40:10,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1812, Unknown=10, NotChecked=0, Total=1980 [2022-07-12 18:40:10,031 INFO L87 Difference]: Start difference. First operand 344 states and 407 transitions. Second operand has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 45 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:40:12,064 INFO L93 Difference]: Finished difference Result 700 states and 837 transitions. [2022-07-12 18:40:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:40:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 45 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-12 18:40:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:40:12,066 INFO L225 Difference]: With dead ends: 700 [2022-07-12 18:40:12,067 INFO L226 Difference]: Without dead ends: 700 [2022-07-12 18:40:12,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=485, Invalid=3165, Unknown=10, NotChecked=0, Total=3660 [2022-07-12 18:40:12,068 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 675 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 3418 SdHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1276 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:40:12,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 3418 Invalid, 3063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1752 Invalid, 0 Unknown, 1276 Unchecked, 0.9s Time] [2022-07-12 18:40:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-07-12 18:40:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 343. [2022-07-12 18:40:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 274 states have (on average 1.4817518248175183) internal successors, (406), 342 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 406 transitions. [2022-07-12 18:40:12,075 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 406 transitions. Word has length 46 [2022-07-12 18:40:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:40:12,075 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 406 transitions. [2022-07-12 18:40:12,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.8636363636363638) internal successors, (126), 45 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 406 transitions. [2022-07-12 18:40:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 18:40:12,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:40:12,076 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, 1, 1, 1, 1, 1, 1] [2022-07-12 18:40:12,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:40:12,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:40:12,300 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:40:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:40:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2037167036, now seen corresponding path program 1 times [2022-07-12 18:40:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:40:12,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403394390] [2022-07-12 18:40:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:40:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:40:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:40:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:40:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:40:12,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403394390] [2022-07-12 18:40:12,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403394390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:40:12,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:40:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:40:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671877006] [2022-07-12 18:40:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:40:12,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:40:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:40:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:40:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:40:12,460 INFO L87 Difference]: Start difference. First operand 343 states and 406 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:40:13,162 INFO L93 Difference]: Finished difference Result 480 states and 538 transitions. [2022-07-12 18:40:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:40:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-07-12 18:40:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:40:13,164 INFO L225 Difference]: With dead ends: 480 [2022-07-12 18:40:13,164 INFO L226 Difference]: Without dead ends: 480 [2022-07-12 18:40:13,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:40:13,165 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 1275 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:40:13,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 922 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:40:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-12 18:40:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 373. [2022-07-12 18:40:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 304 states have (on average 1.5296052631578947) internal successors, (465), 372 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) [2022-07-12 18:40:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 465 transitions. [2022-07-12 18:40:13,170 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 465 transitions. Word has length 48 [2022-07-12 18:40:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:40:13,170 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 465 transitions. [2022-07-12 18:40:13,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 465 transitions. [2022-07-12 18:40:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:40:13,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:40:13,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:40:13,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 18:40:13,172 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:40:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:40:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1246142357, now seen corresponding path program 1 times [2022-07-12 18:40:13,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:40:13,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352431570] [2022-07-12 18:40:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:40:13,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:40:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:40:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:40:13,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:40:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352431570] [2022-07-12 18:40:13,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352431570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:40:13,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108896985] [2022-07-12 18:40:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:40:13,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:40:13,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:40:13,521 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) [2022-07-12 18:40:13,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 18:40:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:40:13,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 18:40:13,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:40:13,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:40:13,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:40:13,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:13,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:40:13,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:13,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:40:13,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:13,929 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:40:13,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 18:40:13,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:13,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:40:14,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:14,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:40:14,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:14,018 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 18:40:14,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 18:40:14,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:14,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 18:40:14,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:14,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:40:14,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:40:14,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:14,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-12 18:40:14,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:14,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:40:14,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-12 18:40:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:40:14,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:40:18,683 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:40:18,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 18:40:18,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-07-12 18:40:18,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:40:18,696 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:40:18,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-12 18:40:18,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:18,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-12 18:40:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:40:18,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108896985] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:40:18,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:40:18,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 32 [2022-07-12 18:40:18,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915173793] [2022-07-12 18:40:18,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:40:18,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 18:40:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:40:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 18:40:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=884, Unknown=3, NotChecked=0, Total=992 [2022-07-12 18:40:18,757 INFO L87 Difference]: Start difference. First operand 373 states and 465 transitions. Second operand has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:40:19,804 INFO L93 Difference]: Finished difference Result 390 states and 482 transitions. [2022-07-12 18:40:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:40:19,805 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-12 18:40:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:40:19,806 INFO L225 Difference]: With dead ends: 390 [2022-07-12 18:40:19,806 INFO L226 Difference]: Without dead ends: 390 [2022-07-12 18:40:19,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=251, Invalid=1638, Unknown=3, NotChecked=0, Total=1892 [2022-07-12 18:40:19,807 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 113 mSDsluCounter, 4242 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 4470 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:40:19,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 4470 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1554 Invalid, 0 Unknown, 412 Unchecked, 0.7s Time] [2022-07-12 18:40:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-07-12 18:40:19,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-07-12 18:40:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.511111111111111) internal successors, (476), 383 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2022-07-12 18:40:19,812 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 51 [2022-07-12 18:40:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:40:19,812 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2022-07-12 18:40:19,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.09375) internal successors, (131), 32 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2022-07-12 18:40:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:40:19,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:40:19,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:40:19,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:40:20,027 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,SelfDestructingSolverStorable36 [2022-07-12 18:40:20,027 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:40:20,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:40:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash 997414492, now seen corresponding path program 1 times [2022-07-12 18:40:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:40:20,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077181922] [2022-07-12 18:40:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:40:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:40:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:40:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:40:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:40:20,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077181922] [2022-07-12 18:40:20,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077181922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:40:20,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:40:20,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:40:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482095404] [2022-07-12 18:40:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:40:20,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:40:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:40:20,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:40:20,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:40:20,104 INFO L87 Difference]: Start difference. First operand 384 states and 476 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:40:20,289 INFO L93 Difference]: Finished difference Result 471 states and 525 transitions. [2022-07-12 18:40:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:40:20,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-07-12 18:40:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:40:20,291 INFO L225 Difference]: With dead ends: 471 [2022-07-12 18:40:20,291 INFO L226 Difference]: Without dead ends: 471 [2022-07-12 18:40:20,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:40:20,291 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1478 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:40:20,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 955 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:40:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-07-12 18:40:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 384. [2022-07-12 18:40:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.507936507936508) internal successors, (475), 383 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 475 transitions. [2022-07-12 18:40:20,298 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 475 transitions. Word has length 53 [2022-07-12 18:40:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:40:20,298 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 475 transitions. [2022-07-12 18:40:20,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:40:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 475 transitions. [2022-07-12 18:40:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:40:20,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:40:20,299 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:40:20,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-12 18:40:20,299 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 149 more)] === [2022-07-12 18:40:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:40:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash -471775986, now seen corresponding path program 1 times [2022-07-12 18:40:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:40:20,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260975744] [2022-07-12 18:40:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:40:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:40:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:40:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:40:21,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:40:21,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260975744] [2022-07-12 18:40:21,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260975744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:40:21,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17446984] [2022-07-12 18:40:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:40:21,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:40:21,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:40:21,503 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) [2022-07-12 18:40:21,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 18:40:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:40:21,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-12 18:40:21,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:40:21,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:40:21,737 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 18:40:21,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 18:40:21,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:40:21,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:21,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-12 18:40:21,900 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-12 18:40:21,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-12 18:40:21,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 18:40:21,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-12 18:40:22,015 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-12 18:40:22,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 26 [2022-07-12 18:40:22,084 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:40:22,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-12 18:40:22,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 18:40:22,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 18:40:22,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:22,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2022-07-12 18:40:22,438 INFO L356 Elim1Store]: treesize reduction 168, result has 33.6 percent of original size [2022-07-12 18:40:22,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 78 treesize of output 139 [2022-07-12 18:40:22,652 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:40:22,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 66 [2022-07-12 18:40:22,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 18:40:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:22,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 18:40:22,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:22,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:22,961 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 18:40:22,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 171 treesize of output 101 [2022-07-12 18:40:23,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:23,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:23,630 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-07-12 18:40:23,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 183 treesize of output 109 [2022-07-12 18:40:23,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:23,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:23,653 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 18:40:23,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 131 [2022-07-12 18:40:24,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:24,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:24,138 INFO L356 Elim1Store]: treesize reduction 59, result has 20.3 percent of original size [2022-07-12 18:40:24,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 213 treesize of output 131 [2022-07-12 18:40:24,156 INFO L356 Elim1Store]: treesize reduction 49, result has 5.8 percent of original size [2022-07-12 18:40:24,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 138 treesize of output 127 [2022-07-12 18:40:24,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:40:24,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 183 treesize of output 163 [2022-07-12 18:40:24,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:40:24,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:40:24,836 INFO L356 Elim1Store]: treesize reduction 112, result has 17.0 percent of original size [2022-07-12 18:40:24,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 166 treesize of output 145 [2022-07-12 18:40:25,397 INFO L356 Elim1Store]: treesize reduction 24, result has 77.1 percent of original size [2022-07-12 18:40:25,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 164 treesize of output 158 [2022-07-12 18:40:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:40:26,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:41:23,632 WARN L233 SmtUtils]: Spent 32.54s on a formula simplification. DAG size of input: 90 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 18:41:23,649 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:41:23,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 224 [2022-07-12 18:41:23,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:41:23,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:41:23,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:41:23,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:41:23,680 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:41:23,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2022-07-12 18:41:23,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:41:23,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 224 [2022-07-12 18:41:24,225 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1853 Int) (v_ArrVal_1855 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_3))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse6 (store .cse2 4 v_ArrVal_1853))) (let ((.cse4 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse6) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4)) (.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1)) (.cse5 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse6 0 .cse4)) .cse4))) (or (not (= (select .cse0 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse2) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= (select .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (not (= (select .cse0 .cse4) 1)) (= (select .cse0 (select .cse5 v_ArrVal_1855)) 1) (= (select .cse0 (select .cse5 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1)))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_ArrVal_1853 Int) (v_ArrVal_1855 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_5))) (let ((.cse12 (store (select .cse11 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse13 (store .cse12 4 v_ArrVal_1853))) (let ((.cse10 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1)) (.cse9 (select (select (store .cse11 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse13) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4))) (let ((.cse8 (select (store .cse11 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse13 0 .cse9)) .cse9)) (.cse7 (store .cse10 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1))) (or (= (select .cse7 (select .cse8 v_ArrVal_1855)) 1) (not (= (select .cse7 .cse9) 1)) (not (= (select .cse10 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse7 (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= (select .cse7 (select (select (store .cse11 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse12) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (not (= (select v_arrayElimArr_5 4) |c_ULTIMATE.start_main_~data~0#1.base|)))))))))) is different from false [2022-07-12 18:41:24,285 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (v_arrayElimArr_5 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_ArrVal_1853 Int) (v_ArrVal_1855 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1837) |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_5))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse6 (store .cse2 4 v_ArrVal_1853))) (let ((.cse5 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse6) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4)) (.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1)) (.cse4 (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse6 0 .cse5)) .cse5))) (or (not (= (select .cse0 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse2) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (not (= (select .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse0 (select .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= (select .cse0 .cse5) 1)) (not (= (select v_arrayElimArr_5 4) |c_ULTIMATE.start_main_~data~0#1.base|)) (= (select .cse0 (select .cse4 v_ArrVal_1855)) 1)))))))) (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1853 Int) (v_ArrVal_1855 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~0#1.base| v_ArrVal_1837) |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_3))) (let ((.cse9 (store (select .cse8 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse13 (store .cse9 4 v_ArrVal_1853))) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1)) (.cse12 (select (select (store .cse8 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse13) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4))) (let ((.cse10 (select (store .cse8 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse13 0 .cse12)) .cse12)) (.cse7 (store .cse11 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1))) (or (not (= (select .cse7 (select (select (store .cse8 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse9) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (= (select .cse7 (select .cse10 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= (select v_arrayElimArr_3 4) |c_ULTIMATE.start_main_~data~0#1.base|)) (not (= (select .cse11 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse7 (select .cse10 v_ArrVal_1855)) 1) (not (= (select .cse7 .cse12) 1)))))))))) is different from false [2022-07-12 18:41:27,366 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-12 18:41:27,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 486 treesize of output 296 [2022-07-12 18:41:27,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:41:27,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:41:27,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 10107 treesize of output 9721 [2022-07-12 18:41:27,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:41:27,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 9713 treesize of output 8263 [2022-07-12 18:41:27,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:41:27,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14067 treesize of output 13943 [2022-07-12 18:41:27,847 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:41:27,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226615 treesize of output 224319