./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0521.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 13:48:27,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:48:27,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:48:27,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:48:27,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:48:27,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:48:27,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:48:27,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:48:27,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:48:27,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:48:27,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:48:27,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:48:27,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:48:27,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:48:27,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:48:27,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:48:27,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:48:27,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:48:27,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:48:27,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:48:27,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:48:27,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:48:27,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:48:27,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:48:27,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:48:27,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:48:27,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:48:27,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:48:27,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:48:27,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:48:27,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:48:27,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:48:27,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:48:27,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:48:27,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:48:27,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:48:27,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:48:27,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:48:27,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:48:27,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:48:27,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:48:27,262 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:48:27,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:48:27,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:48:27,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:48:27,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:48:27,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:48:27,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:48:27,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:48:27,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:48:27,309 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:48:27,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:48:27,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:48:27,311 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:48:27,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:48:27,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:48:27,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:48:27,311 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:48:27,312 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:48:27,312 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:48:27,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:48:27,312 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:48:27,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:48:27,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:48:27,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:48:27,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:48:27,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:48:27,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:48:27,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:48:27,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:48:27,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:48:27,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:48:27,315 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a 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-11-21 13:48:27,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:48:27,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:48:27,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:48:27,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:48:27,652 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:48:27,653 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/memsafety/test-0521.i [2022-11-21 13:48:30,675 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:48:30,921 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:48:30,922 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/sv-benchmarks/c/memsafety/test-0521.i [2022-11-21 13:48:30,934 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/data/b23d0bb03/31dc5441830446dfab42b8f150950791/FLAGc3959deaf [2022-11-21 13:48:30,952 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/data/b23d0bb03/31dc5441830446dfab42b8f150950791 [2022-11-21 13:48:30,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:48:30,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:48:30,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:48:30,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:48:30,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:48:30,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:48:30" (1/1) ... [2022-11-21 13:48:30,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a5cbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:30, skipping insertion in model container [2022-11-21 13:48:30,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:48:30" (1/1) ... [2022-11-21 13:48:30,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:48:31,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:48:31,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:48:31,511 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:48:31,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:48:31,649 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:48:31,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31 WrapperNode [2022-11-21 13:48:31,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:48:31,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:48:31,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:48:31,651 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:48:31,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,706 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 305 [2022-11-21 13:48:31,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:48:31,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:48:31,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:48:31,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:48:31,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:48:31,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:48:31,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:48:31,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:48:31,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (1/1) ... [2022-11-21 13:48:31,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:48:31,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:31,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:48:31,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:48:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:48:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:48:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:48:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:48:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:48:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:48:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:48:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 13:48:31,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:48:31,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:48:31,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:48:32,001 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:48:32,004 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:48:33,023 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:48:33,046 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:48:33,047 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-21 13:48:33,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:48:33 BoogieIcfgContainer [2022-11-21 13:48:33,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:48:33,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:48:33,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:48:33,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:48:33,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:48:30" (1/3) ... [2022-11-21 13:48:33,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1930f176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:48:33, skipping insertion in model container [2022-11-21 13:48:33,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:48:31" (2/3) ... [2022-11-21 13:48:33,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1930f176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:48:33, skipping insertion in model container [2022-11-21 13:48:33,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:48:33" (3/3) ... [2022-11-21 13:48:33,063 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0521.i [2022-11-21 13:48:33,088 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:48:33,088 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 152 error locations. [2022-11-21 13:48:33,175 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:48:33,182 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2486e29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:48:33,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2022-11-21 13:48:33,190 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-11-21 13:48:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 13:48:33,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:33,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 13:48:33,199 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-11-21 13:48:33,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 28729512, now seen corresponding path program 1 times [2022-11-21 13:48:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:33,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477797479] [2022-11-21 13:48:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:33,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477797479] [2022-11-21 13:48:33,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477797479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:33,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:33,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37036265] [2022-11-21 13:48:33,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:33,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:48:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:48:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:48:33,460 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-11-21 13:48:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:33,520 INFO L93 Difference]: Finished difference Result 313 states and 340 transitions. [2022-11-21 13:48:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:48:33,524 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-11-21 13:48:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:33,548 INFO L225 Difference]: With dead ends: 313 [2022-11-21 13:48:33,548 INFO L226 Difference]: Without dead ends: 311 [2022-11-21 13:48:33,550 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-11-21 13:48:33,555 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-11-21 13:48:33,557 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-11-21 13:48:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-21 13:48:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-11-21 13:48:33,611 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-11-21 13:48:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 338 transitions. [2022-11-21 13:48:33,617 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 338 transitions. Word has length 5 [2022-11-21 13:48:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:33,618 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 338 transitions. [2022-11-21 13:48:33,618 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-11-21 13:48:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 338 transitions. [2022-11-21 13:48:33,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:48:33,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:33,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:48:33,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:48:33,620 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-11-21 13:48:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2022-11-21 13:48:33,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:33,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371442368] [2022-11-21 13:48:33,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:33,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:33,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:33,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371442368] [2022-11-21 13:48:33,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371442368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:33,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:33,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:33,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854660679] [2022-11-21 13:48:33,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:33,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:33,711 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-11-21 13:48:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:34,051 INFO L93 Difference]: Finished difference Result 295 states and 322 transitions. [2022-11-21 13:48:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:34,052 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-11-21 13:48:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:34,054 INFO L225 Difference]: With dead ends: 295 [2022-11-21 13:48:34,054 INFO L226 Difference]: Without dead ends: 295 [2022-11-21 13:48:34,054 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-11-21 13:48:34,056 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 77 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:34,056 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.3s Time] [2022-11-21 13:48:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-21 13:48:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-11-21 13:48:34,068 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-11-21 13:48:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 322 transitions. [2022-11-21 13:48:34,069 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 322 transitions. Word has length 6 [2022-11-21 13:48:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:34,070 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 322 transitions. [2022-11-21 13:48:34,070 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-11-21 13:48:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 322 transitions. [2022-11-21 13:48:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:48:34,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:34,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:48:34,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:48:34,072 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-11-21 13:48:34,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash 889570249, now seen corresponding path program 1 times [2022-11-21 13:48:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280577121] [2022-11-21 13:48:34,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:34,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:34,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280577121] [2022-11-21 13:48:34,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280577121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:34,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:34,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942929171] [2022-11-21 13:48:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:34,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:34,252 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-11-21 13:48:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:34,559 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2022-11-21 13:48:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:34,560 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-11-21 13:48:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:34,561 INFO L225 Difference]: With dead ends: 279 [2022-11-21 13:48:34,561 INFO L226 Difference]: Without dead ends: 279 [2022-11-21 13:48:34,562 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-11-21 13:48:34,563 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 61 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:34,563 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.3s Time] [2022-11-21 13:48:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-21 13:48:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-11-21 13:48:34,599 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-11-21 13:48:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 306 transitions. [2022-11-21 13:48:34,601 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 306 transitions. Word has length 6 [2022-11-21 13:48:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:34,601 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 306 transitions. [2022-11-21 13:48:34,602 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-11-21 13:48:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 306 transitions. [2022-11-21 13:48:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:48:34,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:34,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:48:34,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:48:34,603 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-11-21 13:48:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:34,604 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-11-21 13:48:34,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:34,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735744827] [2022-11-21 13:48:34,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:34,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:34,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735744827] [2022-11-21 13:48:34,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735744827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:34,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:34,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421438109] [2022-11-21 13:48:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:34,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:34,687 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-11-21 13:48:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:34,967 INFO L93 Difference]: Finished difference Result 334 states and 370 transitions. [2022-11-21 13:48:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:34,968 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-11-21 13:48:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:34,970 INFO L225 Difference]: With dead ends: 334 [2022-11-21 13:48:34,970 INFO L226 Difference]: Without dead ends: 334 [2022-11-21 13:48:34,970 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-11-21 13:48:34,971 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:34,972 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.3s Time] [2022-11-21 13:48:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-21 13:48:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 277. [2022-11-21 13:48:34,998 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-11-21 13:48:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 304 transitions. [2022-11-21 13:48:34,999 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 304 transitions. Word has length 6 [2022-11-21 13:48:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:35,000 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 304 transitions. [2022-11-21 13:48:35,000 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-11-21 13:48:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 304 transitions. [2022-11-21 13:48:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:48:35,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:35,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:48:35,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:48:35,002 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-11-21 13:48:35,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-11-21 13:48:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:35,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635206244] [2022-11-21 13:48:35,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:35,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:35,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635206244] [2022-11-21 13:48:35,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635206244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:35,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:35,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:35,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795117770] [2022-11-21 13:48:35,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:35,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:35,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:35,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:35,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:35,133 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-11-21 13:48:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:35,467 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2022-11-21 13:48:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:35,467 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-11-21 13:48:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:35,469 INFO L225 Difference]: With dead ends: 466 [2022-11-21 13:48:35,469 INFO L226 Difference]: Without dead ends: 466 [2022-11-21 13:48:35,469 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-11-21 13:48:35,470 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 220 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:35,471 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.3s Time] [2022-11-21 13:48:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-21 13:48:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 275. [2022-11-21 13:48:35,477 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-11-21 13:48:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 302 transitions. [2022-11-21 13:48:35,478 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 302 transitions. Word has length 6 [2022-11-21 13:48:35,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:35,479 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 302 transitions. [2022-11-21 13:48:35,479 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-11-21 13:48:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 302 transitions. [2022-11-21 13:48:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 13:48:35,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:35,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:35,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:48:35,482 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-11-21 13:48:35,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash 178517033, now seen corresponding path program 1 times [2022-11-21 13:48:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:35,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337945805] [2022-11-21 13:48:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:35,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337945805] [2022-11-21 13:48:35,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337945805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:35,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:35,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:48:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533279782] [2022-11-21 13:48:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:35,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:48:35,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:48:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:48:35,542 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-11-21 13:48:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:35,612 INFO L93 Difference]: Finished difference Result 678 states and 747 transitions. [2022-11-21 13:48:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:48:35,612 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-11-21 13:48:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:35,615 INFO L225 Difference]: With dead ends: 678 [2022-11-21 13:48:35,615 INFO L226 Difference]: Without dead ends: 678 [2022-11-21 13:48:35,616 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-11-21 13:48:35,616 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-11-21 13:48:35,617 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-11-21 13:48:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-21 13:48:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 280. [2022-11-21 13:48:35,632 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-11-21 13:48:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 308 transitions. [2022-11-21 13:48:35,633 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 308 transitions. Word has length 8 [2022-11-21 13:48:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:35,633 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 308 transitions. [2022-11-21 13:48:35,633 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-11-21 13:48:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 308 transitions. [2022-11-21 13:48:35,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:48:35,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:35,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:35,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:48:35,635 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-11-21 13:48:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:35,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660206, now seen corresponding path program 1 times [2022-11-21 13:48:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:35,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505437398] [2022-11-21 13:48:35,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:35,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:35,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505437398] [2022-11-21 13:48:35,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505437398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:35,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:35,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461573008] [2022-11-21 13:48:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:35,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:35,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:35,726 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-11-21 13:48:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:35,983 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2022-11-21 13:48:35,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:35,984 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-11-21 13:48:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:35,986 INFO L225 Difference]: With dead ends: 330 [2022-11-21 13:48:35,986 INFO L226 Difference]: Without dead ends: 330 [2022-11-21 13:48:35,986 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-11-21 13:48:35,987 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 72 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11-21 13:48:35,988 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-11-21 13:48:35,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-21 13:48:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 278. [2022-11-21 13:48:35,993 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-11-21 13:48:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 306 transitions. [2022-11-21 13:48:35,995 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 306 transitions. Word has length 11 [2022-11-21 13:48:35,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:35,995 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 306 transitions. [2022-11-21 13:48:35,995 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-11-21 13:48:35,995 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 306 transitions. [2022-11-21 13:48:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:48:35,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:35,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:35,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:48:35,996 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-11-21 13:48:35,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:35,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2119660205, now seen corresponding path program 1 times [2022-11-21 13:48:35,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:35,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964657810] [2022-11-21 13:48:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:35,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:36,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964657810] [2022-11-21 13:48:36,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964657810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:36,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:36,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839604291] [2022-11-21 13:48:36,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:36,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:36,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:36,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:36,073 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-11-21 13:48:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:36,403 INFO L93 Difference]: Finished difference Result 462 states and 510 transitions. [2022-11-21 13:48:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:36,403 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-11-21 13:48:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:36,405 INFO L225 Difference]: With dead ends: 462 [2022-11-21 13:48:36,405 INFO L226 Difference]: Without dead ends: 462 [2022-11-21 13:48:36,406 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-11-21 13:48:36,406 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:36,407 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.3s Time] [2022-11-21 13:48:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-21 13:48:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 276. [2022-11-21 13:48:36,412 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-11-21 13:48:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 304 transitions. [2022-11-21 13:48:36,413 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 304 transitions. Word has length 11 [2022-11-21 13:48:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:36,414 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 304 transitions. [2022-11-21 13:48:36,414 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-11-21 13:48:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 304 transitions. [2022-11-21 13:48:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 13:48:36,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:36,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:36,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:48:36,415 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-11-21 13:48:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1231388841, now seen corresponding path program 1 times [2022-11-21 13:48:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:36,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460577773] [2022-11-21 13:48:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:36,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460577773] [2022-11-21 13:48:36,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460577773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:36,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:36,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:48:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765055498] [2022-11-21 13:48:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:36,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:48:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:48:36,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:48:36,544 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-11-21 13:48:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:36,827 INFO L93 Difference]: Finished difference Result 666 states and 735 transitions. [2022-11-21 13:48:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:48:36,828 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-11-21 13:48:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:36,830 INFO L225 Difference]: With dead ends: 666 [2022-11-21 13:48:36,830 INFO L226 Difference]: Without dead ends: 666 [2022-11-21 13:48:36,831 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-11-21 13:48:36,831 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 585 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:36,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1363 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:48:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-11-21 13:48:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 279. [2022-11-21 13:48:36,839 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-11-21 13:48:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 307 transitions. [2022-11-21 13:48:36,840 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 307 transitions. Word has length 13 [2022-11-21 13:48:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:36,840 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 307 transitions. [2022-11-21 13:48:36,841 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-11-21 13:48:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 307 transitions. [2022-11-21 13:48:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:48:36,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:36,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:36,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:48:36,842 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-11-21 13:48:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2035528525, now seen corresponding path program 1 times [2022-11-21 13:48:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:36,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843863330] [2022-11-21 13:48:36,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:36,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:36,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843863330] [2022-11-21 13:48:36,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843863330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:36,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:36,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:48:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022299844] [2022-11-21 13:48:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:36,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:36,919 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-11-21 13:48:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:37,027 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2022-11-21 13:48:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:48:37,027 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-11-21 13:48:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:37,029 INFO L225 Difference]: With dead ends: 408 [2022-11-21 13:48:37,029 INFO L226 Difference]: Without dead ends: 408 [2022-11-21 13:48:37,030 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-11-21 13:48:37,031 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 240 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:37,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1120 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:48:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-11-21 13:48:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 343. [2022-11-21 13:48:37,039 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-11-21 13:48:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 435 transitions. [2022-11-21 13:48:37,040 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 435 transitions. Word has length 15 [2022-11-21 13:48:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:37,040 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 435 transitions. [2022-11-21 13:48:37,041 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-11-21 13:48:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 435 transitions. [2022-11-21 13:48:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 13:48:37,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:37,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:37,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:48:37,044 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-11-21 13:48:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1316385230, now seen corresponding path program 1 times [2022-11-21 13:48:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:37,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219898770] [2022-11-21 13:48:37,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:37,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:37,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219898770] [2022-11-21 13:48:37,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219898770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:37,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:37,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:48:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848118126] [2022-11-21 13:48:37,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:37,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:37,088 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-11-21 13:48:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:37,104 INFO L93 Difference]: Finished difference Result 328 states and 410 transitions. [2022-11-21 13:48:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:37,104 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-11-21 13:48:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:37,106 INFO L225 Difference]: With dead ends: 328 [2022-11-21 13:48:37,106 INFO L226 Difference]: Without dead ends: 328 [2022-11-21 13:48:37,106 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-11-21 13:48:37,107 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-11-21 13:48:37,107 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-11-21 13:48:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-21 13:48:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-11-21 13:48:37,113 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-11-21 13:48:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2022-11-21 13:48:37,115 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 16 [2022-11-21 13:48:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:37,115 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2022-11-21 13:48:37,115 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-11-21 13:48:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2022-11-21 13:48:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:48:37,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:37,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:37,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:48:37,117 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-11-21 13:48:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989585, now seen corresponding path program 1 times [2022-11-21 13:48:37,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:37,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390930252] [2022-11-21 13:48:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:37,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390930252] [2022-11-21 13:48:37,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390930252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:37,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:37,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:37,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171855359] [2022-11-21 13:48:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:37,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:37,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:37,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:37,156 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-11-21 13:48:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:37,356 INFO L93 Difference]: Finished difference Result 312 states and 378 transitions. [2022-11-21 13:48:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:37,356 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-11-21 13:48:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:37,357 INFO L225 Difference]: With dead ends: 312 [2022-11-21 13:48:37,358 INFO L226 Difference]: Without dead ends: 312 [2022-11-21 13:48:37,358 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-11-21 13:48:37,358 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 77 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:37,359 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.2s Time] [2022-11-21 13:48:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-21 13:48:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-11-21 13:48:37,364 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-11-21 13:48:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2022-11-21 13:48:37,365 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 378 transitions. Word has length 17 [2022-11-21 13:48:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:37,366 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 378 transitions. [2022-11-21 13:48:37,366 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-11-21 13:48:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 378 transitions. [2022-11-21 13:48:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 13:48:37,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:37,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:37,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:48:37,371 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-11-21 13:48:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1932989586, now seen corresponding path program 1 times [2022-11-21 13:48:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:37,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682675423] [2022-11-21 13:48:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:37,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:37,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682675423] [2022-11-21 13:48:37,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682675423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:37,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:37,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:48:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487842439] [2022-11-21 13:48:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:37,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:37,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:37,467 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-11-21 13:48:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:37,656 INFO L93 Difference]: Finished difference Result 296 states and 346 transitions. [2022-11-21 13:48:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:37,657 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-11-21 13:48:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:37,658 INFO L225 Difference]: With dead ends: 296 [2022-11-21 13:48:37,658 INFO L226 Difference]: Without dead ends: 296 [2022-11-21 13:48:37,658 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-11-21 13:48:37,659 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:37,659 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.2s Time] [2022-11-21 13:48:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-21 13:48:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-11-21 13:48:37,665 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-11-21 13:48:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 346 transitions. [2022-11-21 13:48:37,667 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 346 transitions. Word has length 17 [2022-11-21 13:48:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:37,668 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 346 transitions. [2022-11-21 13:48:37,669 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-11-21 13:48:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 346 transitions. [2022-11-21 13:48:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:48:37,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:37,670 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-11-21 13:48:37,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:48:37,671 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-11-21 13:48:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2117838446, now seen corresponding path program 1 times [2022-11-21 13:48:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:37,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601201362] [2022-11-21 13:48:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:37,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601201362] [2022-11-21 13:48:37,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601201362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:37,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:37,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:48:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052333385] [2022-11-21 13:48:37,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:37,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:37,785 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-11-21 13:48:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:37,925 INFO L93 Difference]: Finished difference Result 394 states and 436 transitions. [2022-11-21 13:48:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:48:37,926 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-11-21 13:48:37,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:37,927 INFO L225 Difference]: With dead ends: 394 [2022-11-21 13:48:37,928 INFO L226 Difference]: Without dead ends: 394 [2022-11-21 13:48:37,928 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-11-21 13:48:37,929 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 278 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:37,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 994 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:48:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-21 13:48:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 293. [2022-11-21 13:48:37,935 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-11-21 13:48:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 340 transitions. [2022-11-21 13:48:37,936 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 340 transitions. Word has length 19 [2022-11-21 13:48:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:37,937 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 340 transitions. [2022-11-21 13:48:37,937 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-11-21 13:48:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 340 transitions. [2022-11-21 13:48:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:48:37,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:37,938 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:37,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:48:37,938 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-11-21 13:48:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279430, now seen corresponding path program 1 times [2022-11-21 13:48:37,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:37,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926642984] [2022-11-21 13:48:37,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:38,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926642984] [2022-11-21 13:48:38,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926642984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:38,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:38,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:48:38,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442639292] [2022-11-21 13:48:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:38,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:48:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:38,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:48:38,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:48:38,074 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-11-21 13:48:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:38,422 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2022-11-21 13:48:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:48:38,422 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-11-21 13:48:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:38,424 INFO L225 Difference]: With dead ends: 316 [2022-11-21 13:48:38,424 INFO L226 Difference]: Without dead ends: 316 [2022-11-21 13:48:38,424 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-11-21 13:48:38,424 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 271 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:38,425 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.3s Time] [2022-11-21 13:48:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-21 13:48:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 295. [2022-11-21 13:48:38,429 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-11-21 13:48:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 345 transitions. [2022-11-21 13:48:38,434 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 345 transitions. Word has length 19 [2022-11-21 13:48:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:38,435 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 345 transitions. [2022-11-21 13:48:38,435 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-11-21 13:48:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 345 transitions. [2022-11-21 13:48:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 13:48:38,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:38,436 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:48:38,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:48:38,437 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-11-21 13:48:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1413279429, now seen corresponding path program 1 times [2022-11-21 13:48:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:38,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958669692] [2022-11-21 13:48:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958669692] [2022-11-21 13:48:38,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958669692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:38,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:38,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:48:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629356209] [2022-11-21 13:48:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:38,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:38,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:38,653 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-11-21 13:48:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:39,074 INFO L93 Difference]: Finished difference Result 409 states and 475 transitions. [2022-11-21 13:48:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:48:39,075 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-11-21 13:48:39,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:39,076 INFO L225 Difference]: With dead ends: 409 [2022-11-21 13:48:39,077 INFO L226 Difference]: Without dead ends: 409 [2022-11-21 13:48:39,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:48:39,078 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 437 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:39,078 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.4s Time] [2022-11-21 13:48:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-21 13:48:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 294. [2022-11-21 13:48:39,084 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-11-21 13:48:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 344 transitions. [2022-11-21 13:48:39,085 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 344 transitions. Word has length 19 [2022-11-21 13:48:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:39,085 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 344 transitions. [2022-11-21 13:48:39,085 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-11-21 13:48:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 344 transitions. [2022-11-21 13:48:39,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:48:39,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:39,086 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-11-21 13:48:39,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:48:39,086 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-11-21 13:48:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash -805519643, now seen corresponding path program 1 times [2022-11-21 13:48:39,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:39,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191889127] [2022-11-21 13:48:39,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:39,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191889127] [2022-11-21 13:48:39,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191889127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:39,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:39,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:48:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920038596] [2022-11-21 13:48:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:39,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:48:39,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:39,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:48:39,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:48:39,276 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-11-21 13:48:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:39,580 INFO L93 Difference]: Finished difference Result 394 states and 442 transitions. [2022-11-21 13:48:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:48:39,581 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-11-21 13:48:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:39,582 INFO L225 Difference]: With dead ends: 394 [2022-11-21 13:48:39,582 INFO L226 Difference]: Without dead ends: 394 [2022-11-21 13:48:39,583 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-11-21 13:48:39,583 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 265 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:39,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1409 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:48:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-11-21 13:48:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 280. [2022-11-21 13:48:39,589 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-11-21 13:48:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 321 transitions. [2022-11-21 13:48:39,590 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 321 transitions. Word has length 24 [2022-11-21 13:48:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:39,590 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 321 transitions. [2022-11-21 13:48:39,590 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-11-21 13:48:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 321 transitions. [2022-11-21 13:48:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:48:39,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:39,591 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-11-21 13:48:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 13:48:39,591 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-11-21 13:48:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1972902682, now seen corresponding path program 1 times [2022-11-21 13:48:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:39,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393531567] [2022-11-21 13:48:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:39,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393531567] [2022-11-21 13:48:39,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393531567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:39,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:39,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:48:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404770824] [2022-11-21 13:48:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:39,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:39,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:39,659 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-11-21 13:48:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:39,735 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2022-11-21 13:48:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:48:39,735 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-11-21 13:48:39,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:39,737 INFO L225 Difference]: With dead ends: 298 [2022-11-21 13:48:39,737 INFO L226 Difference]: Without dead ends: 298 [2022-11-21 13:48:39,737 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-11-21 13:48:39,738 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-11-21 13:48:39,738 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-11-21 13:48:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-21 13:48:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 280. [2022-11-21 13:48:39,747 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-11-21 13:48:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 320 transitions. [2022-11-21 13:48:39,748 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 320 transitions. Word has length 24 [2022-11-21 13:48:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:39,748 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 320 transitions. [2022-11-21 13:48:39,748 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-11-21 13:48:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 320 transitions. [2022-11-21 13:48:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 13:48:39,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:39,749 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-11-21 13:48:39,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:48:39,749 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-11-21 13:48:39,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1021020451, now seen corresponding path program 1 times [2022-11-21 13:48:39,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:39,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817915023] [2022-11-21 13:48:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817915023] [2022-11-21 13:48:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817915023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:39,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:39,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:48:39,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307583683] [2022-11-21 13:48:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:39,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:39,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:39,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:39,873 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-11-21 13:48:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:40,188 INFO L93 Difference]: Finished difference Result 288 states and 321 transitions. [2022-11-21 13:48:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:48:40,188 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-11-21 13:48:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:40,190 INFO L225 Difference]: With dead ends: 288 [2022-11-21 13:48:40,190 INFO L226 Difference]: Without dead ends: 284 [2022-11-21 13:48:40,190 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-11-21 13:48:40,190 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.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:40,191 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.3s Time] [2022-11-21 13:48:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-21 13:48:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 278. [2022-11-21 13:48:40,195 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-11-21 13:48:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 317 transitions. [2022-11-21 13:48:40,196 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 317 transitions. Word has length 26 [2022-11-21 13:48:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:40,196 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 317 transitions. [2022-11-21 13:48:40,196 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-11-21 13:48:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2022-11-21 13:48:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 13:48:40,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:40,197 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-11-21 13:48:40,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:48:40,197 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-11-21 13:48:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1580222949, now seen corresponding path program 1 times [2022-11-21 13:48:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:40,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35151687] [2022-11-21 13:48:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:40,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:40,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35151687] [2022-11-21 13:48:40,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35151687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:40,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:40,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:48:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329095259] [2022-11-21 13:48:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:40,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:48:40,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:40,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:48:40,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:48:40,244 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-11-21 13:48:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:40,260 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2022-11-21 13:48:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:48:40,260 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-11-21 13:48:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:40,262 INFO L225 Difference]: With dead ends: 263 [2022-11-21 13:48:40,262 INFO L226 Difference]: Without dead ends: 245 [2022-11-21 13:48:40,262 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-11-21 13:48:40,263 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-11-21 13:48:40,264 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-11-21 13:48:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-21 13:48:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-11-21 13:48:40,268 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-11-21 13:48:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-11-21 13:48:40,270 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 27 [2022-11-21 13:48:40,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:40,270 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-11-21 13:48:40,270 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-11-21 13:48:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-11-21 13:48:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 13:48:40,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:40,271 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-11-21 13:48:40,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:48:40,272 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-11-21 13:48:40,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321696, now seen corresponding path program 1 times [2022-11-21 13:48:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:40,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387021740] [2022-11-21 13:48:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:40,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:40,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387021740] [2022-11-21 13:48:40,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387021740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:40,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:40,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 13:48:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474274368] [2022-11-21 13:48:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 13:48:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:40,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 13:48:40,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:48:40,842 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-11-21 13:48:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:41,992 INFO L93 Difference]: Finished difference Result 251 states and 280 transitions. [2022-11-21 13:48:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 13:48:41,993 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-11-21 13:48:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:41,995 INFO L225 Difference]: With dead ends: 251 [2022-11-21 13:48:41,995 INFO L226 Difference]: Without dead ends: 251 [2022-11-21 13:48:41,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:48:41,996 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 289 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:41,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1314 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 13:48:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-21 13:48:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 244. [2022-11-21 13:48:42,002 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-11-21 13:48:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 273 transitions. [2022-11-21 13:48:42,003 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 273 transitions. Word has length 27 [2022-11-21 13:48:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:42,003 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 273 transitions. [2022-11-21 13:48:42,003 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-11-21 13:48:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 273 transitions. [2022-11-21 13:48:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-21 13:48:42,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:42,004 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-11-21 13:48:42,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:48:42,005 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-11-21 13:48:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1161321697, now seen corresponding path program 1 times [2022-11-21 13:48:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:42,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492852544] [2022-11-21 13:48:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:42,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:42,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:42,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492852544] [2022-11-21 13:48:42,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492852544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:42,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:42,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 13:48:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943020147] [2022-11-21 13:48:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:42,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-21 13:48:42,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:42,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-21 13:48:42,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:48:42,884 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-11-21 13:48:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:44,868 INFO L93 Difference]: Finished difference Result 504 states and 573 transitions. [2022-11-21 13:48:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:48:44,870 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-11-21 13:48:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:44,872 INFO L225 Difference]: With dead ends: 504 [2022-11-21 13:48:44,872 INFO L226 Difference]: Without dead ends: 504 [2022-11-21 13:48:44,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-11-21 13:48:44,873 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 727 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:44,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1864 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 13:48:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-11-21 13:48:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 243. [2022-11-21 13:48:44,879 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-11-21 13:48:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 272 transitions. [2022-11-21 13:48:44,880 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 272 transitions. Word has length 27 [2022-11-21 13:48:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:44,880 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 272 transitions. [2022-11-21 13:48:44,880 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-11-21 13:48:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 272 transitions. [2022-11-21 13:48:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:48:44,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:44,881 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-11-21 13:48:44,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:48:44,881 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-11-21 13:48:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash -672116074, now seen corresponding path program 1 times [2022-11-21 13:48:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:44,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852498394] [2022-11-21 13:48:44,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:44,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:45,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:45,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852498394] [2022-11-21 13:48:45,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852498394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:45,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:45,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:48:45,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132723831] [2022-11-21 13:48:45,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:45,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:48:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:45,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:48:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:48:45,085 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-11-21 13:48:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:45,374 INFO L93 Difference]: Finished difference Result 265 states and 296 transitions. [2022-11-21 13:48:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:48:45,374 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-11-21 13:48:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:45,376 INFO L225 Difference]: With dead ends: 265 [2022-11-21 13:48:45,376 INFO L226 Difference]: Without dead ends: 265 [2022-11-21 13:48:45,376 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-11-21 13:48:45,377 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 745 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:45,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 934 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:48:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-21 13:48:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 243. [2022-11-21 13:48:45,383 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-11-21 13:48:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 271 transitions. [2022-11-21 13:48:45,384 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 271 transitions. Word has length 29 [2022-11-21 13:48:45,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:45,384 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 271 transitions. [2022-11-21 13:48:45,384 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-11-21 13:48:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 271 transitions. [2022-11-21 13:48:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 13:48:45,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:45,386 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-11-21 13:48:45,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 13:48:45,387 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-11-21 13:48:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 102015914, now seen corresponding path program 1 times [2022-11-21 13:48:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:45,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216054453] [2022-11-21 13:48:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:48:45,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:45,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216054453] [2022-11-21 13:48:45,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216054453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:45,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:45,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:48:45,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679478021] [2022-11-21 13:48:45,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:45,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:45,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:45,595 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-11-21 13:48:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:45,889 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2022-11-21 13:48:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:48:45,889 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-11-21 13:48:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:45,890 INFO L225 Difference]: With dead ends: 259 [2022-11-21 13:48:45,890 INFO L226 Difference]: Without dead ends: 259 [2022-11-21 13:48:45,891 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-11-21 13:48:45,891 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 52 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:45,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 673 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:48:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-21 13:48:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 242. [2022-11-21 13:48:45,895 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-11-21 13:48:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2022-11-21 13:48:45,896 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 31 [2022-11-21 13:48:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:45,897 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2022-11-21 13:48:45,897 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-11-21 13:48:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2022-11-21 13:48:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 13:48:45,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:45,898 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-11-21 13:48:45,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 13:48:45,898 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-11-21 13:48:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash 102015915, now seen corresponding path program 1 times [2022-11-21 13:48:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:45,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728427264] [2022-11-21 13:48:45,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:46,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728427264] [2022-11-21 13:48:46,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728427264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:46,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:46,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:48:46,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759126955] [2022-11-21 13:48:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:46,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:48:46,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:48:46,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:48:46,432 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-11-21 13:48:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:47,235 INFO L93 Difference]: Finished difference Result 374 states and 421 transitions. [2022-11-21 13:48:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:48:47,235 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-11-21 13:48:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:47,237 INFO L225 Difference]: With dead ends: 374 [2022-11-21 13:48:47,237 INFO L226 Difference]: Without dead ends: 374 [2022-11-21 13:48:47,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:48:47,238 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 567 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:47,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 947 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 13:48:47,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-21 13:48:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 241. [2022-11-21 13:48:47,242 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-11-21 13:48:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 269 transitions. [2022-11-21 13:48:47,243 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 269 transitions. Word has length 31 [2022-11-21 13:48:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:47,244 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 269 transitions. [2022-11-21 13:48:47,244 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-11-21 13:48:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 269 transitions. [2022-11-21 13:48:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:48:47,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:47,244 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-11-21 13:48:47,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 13:48:47,245 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-11-21 13:48:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:47,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778921, now seen corresponding path program 1 times [2022-11-21 13:48:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:47,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405912450] [2022-11-21 13:48:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:47,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:47,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405912450] [2022-11-21 13:48:47,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405912450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:47,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:47,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:48:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558406941] [2022-11-21 13:48:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:47,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:48:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:48:47,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:48:47,479 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-11-21 13:48:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:48,018 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2022-11-21 13:48:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:48:48,018 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-11-21 13:48:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:48,020 INFO L225 Difference]: With dead ends: 398 [2022-11-21 13:48:48,020 INFO L226 Difference]: Without dead ends: 398 [2022-11-21 13:48:48,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:48:48,020 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 580 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:48,021 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.5s Time] [2022-11-21 13:48:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-21 13:48:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 244. [2022-11-21 13:48:48,025 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-11-21 13:48:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 276 transitions. [2022-11-21 13:48:48,026 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 276 transitions. Word has length 34 [2022-11-21 13:48:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:48,026 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 276 transitions. [2022-11-21 13:48:48,029 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-11-21 13:48:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 276 transitions. [2022-11-21 13:48:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:48:48,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:48,030 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-11-21 13:48:48,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 13:48:48,030 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-11-21 13:48:48,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:48,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1705778920, now seen corresponding path program 1 times [2022-11-21 13:48:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:48,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123708659] [2022-11-21 13:48:48,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:48,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123708659] [2022-11-21 13:48:48,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123708659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:48,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:48,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:48:48,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889660051] [2022-11-21 13:48:48,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:48,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:48:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:48,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:48:48,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:48:48,350 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-11-21 13:48:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:49,131 INFO L93 Difference]: Finished difference Result 496 states and 560 transitions. [2022-11-21 13:48:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:48:49,131 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-11-21 13:48:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:49,133 INFO L225 Difference]: With dead ends: 496 [2022-11-21 13:48:49,133 INFO L226 Difference]: Without dead ends: 496 [2022-11-21 13:48:49,134 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-11-21 13:48:49,134 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 722 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:49,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 715 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:48:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-11-21 13:48:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 308. [2022-11-21 13:48:49,147 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-11-21 13:48:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 373 transitions. [2022-11-21 13:48:49,148 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 373 transitions. Word has length 34 [2022-11-21 13:48:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:49,148 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 373 transitions. [2022-11-21 13:48:49,149 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-11-21 13:48:49,149 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 373 transitions. [2022-11-21 13:48:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 13:48:49,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:49,150 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-11-21 13:48:49,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 13:48:49,152 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-11-21 13:48:49,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1332799064, now seen corresponding path program 1 times [2022-11-21 13:48:49,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:49,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453193428] [2022-11-21 13:48:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:50,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:50,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453193428] [2022-11-21 13:48:50,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453193428] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:50,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:50,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-21 13:48:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429024608] [2022-11-21 13:48:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:50,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 13:48:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 13:48:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-21 13:48:50,354 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-11-21 13:48:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:51,913 INFO L93 Difference]: Finished difference Result 310 states and 374 transitions. [2022-11-21 13:48:51,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:48:51,914 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-11-21 13:48:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:51,915 INFO L225 Difference]: With dead ends: 310 [2022-11-21 13:48:51,915 INFO L226 Difference]: Without dead ends: 310 [2022-11-21 13:48:51,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-11-21 13:48:51,916 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 310 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:51,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1865 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 13:48:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-21 13:48:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2022-11-21 13:48:51,921 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-11-21 13:48:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 372 transitions. [2022-11-21 13:48:51,926 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 372 transitions. Word has length 35 [2022-11-21 13:48:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:51,927 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 372 transitions. [2022-11-21 13:48:51,927 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-11-21 13:48:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 372 transitions. [2022-11-21 13:48:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 13:48:51,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:51,928 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-11-21 13:48:51,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 13:48:51,928 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-11-21 13:48:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash -561839822, now seen corresponding path program 1 times [2022-11-21 13:48:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:51,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894968848] [2022-11-21 13:48:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:52,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:52,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894968848] [2022-11-21 13:48:52,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894968848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:48:52,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52803267] [2022-11-21 13:48:52,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:52,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:48:52,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:48:52,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:48:52,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:48:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:53,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-21 13:48:53,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:48:53,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:48:53,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:48:53,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:48:53,343 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:48:53,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 13:48:53,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-21 13:48:53,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-21 13:48:53,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 13:48:53,433 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 13:48:53,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-11-21 13:48:53,530 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 13:48:53,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 41 [2022-11-21 13:48:53,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 13:48:53,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:53,638 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-21 13:48:53,639 INFO L350 Elim1Store]: Elim1 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-11-21 13:48:53,650 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:48:53,650 INFO L350 Elim1Store]: Elim1 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-11-21 13:48:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:53,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:48:54,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:48:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:55,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52803267] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:48:55,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:48:55,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 11] total 22 [2022-11-21 13:48:55,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124236304] [2022-11-21 13:48:55,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:48:55,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 13:48:55,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:55,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 13:48:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-11-21 13:48:55,013 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-11-21 13:48:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:57,078 INFO L93 Difference]: Finished difference Result 367 states and 436 transitions. [2022-11-21 13:48:57,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:48:57,078 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-11-21 13:48:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:57,081 INFO L225 Difference]: With dead ends: 367 [2022-11-21 13:48:57,081 INFO L226 Difference]: Without dead ends: 367 [2022-11-21 13:48:57,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2022-11-21 13:48:57,082 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 107 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:57,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 2707 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-21 13:48:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-21 13:48:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 337. [2022-11-21 13:48:57,088 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-11-21 13:48:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 402 transitions. [2022-11-21 13:48:57,089 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 402 transitions. Word has length 35 [2022-11-21 13:48:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:57,090 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 402 transitions. [2022-11-21 13:48:57,090 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-11-21 13:48:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 402 transitions. [2022-11-21 13:48:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 13:48:57,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:57,091 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-11-21 13:48:57,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 13:48:57,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-21 13:48:57,298 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-11-21 13:48:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2034656951, now seen corresponding path program 1 times [2022-11-21 13:48:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:57,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300555497] [2022-11-21 13:48:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:48:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:57,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300555497] [2022-11-21 13:48:57,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300555497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:57,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:57,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:48:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183389088] [2022-11-21 13:48:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:57,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:57,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:57,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:57,529 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-11-21 13:48:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:57,769 INFO L93 Difference]: Finished difference Result 343 states and 409 transitions. [2022-11-21 13:48:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:48:57,770 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-11-21 13:48:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:57,772 INFO L225 Difference]: With dead ends: 343 [2022-11-21 13:48:57,772 INFO L226 Difference]: Without dead ends: 343 [2022-11-21 13:48:57,772 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-11-21 13:48:57,773 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:57,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 845 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:48:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-21 13:48:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2022-11-21 13:48:57,781 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-11-21 13:48:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 407 transitions. [2022-11-21 13:48:57,782 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 407 transitions. Word has length 40 [2022-11-21 13:48:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:57,783 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 407 transitions. [2022-11-21 13:48:57,783 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-11-21 13:48:57,783 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 407 transitions. [2022-11-21 13:48:57,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-21 13:48:57,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:57,784 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-11-21 13:48:57,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-21 13:48:57,785 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-11-21 13:48:57,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 854914797, now seen corresponding path program 1 times [2022-11-21 13:48:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:57,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629796339] [2022-11-21 13:48:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:58,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629796339] [2022-11-21 13:48:58,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629796339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:58,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:58,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:48:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160712796] [2022-11-21 13:48:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:58,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:48:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:48:58,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:48:58,047 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-11-21 13:48:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:58,406 INFO L93 Difference]: Finished difference Result 461 states and 515 transitions. [2022-11-21 13:48:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 13:48:58,407 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-11-21 13:48:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:58,408 INFO L225 Difference]: With dead ends: 461 [2022-11-21 13:48:58,408 INFO L226 Difference]: Without dead ends: 461 [2022-11-21 13:48:58,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-11-21 13:48:58,410 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 1414 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:58,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 956 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:48:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-11-21 13:48:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 340. [2022-11-21 13:48:58,417 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-11-21 13:48:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 403 transitions. [2022-11-21 13:48:58,418 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 403 transitions. Word has length 43 [2022-11-21 13:48:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:58,418 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 403 transitions. [2022-11-21 13:48:58,418 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-11-21 13:48:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 403 transitions. [2022-11-21 13:48:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 13:48:58,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:58,419 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-11-21 13:48:58,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-21 13:48:58,420 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-11-21 13:48:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 190981616, now seen corresponding path program 1 times [2022-11-21 13:48:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:58,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494119112] [2022-11-21 13:48:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:48:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494119112] [2022-11-21 13:48:58,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494119112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:58,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:58,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:48:58,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902823930] [2022-11-21 13:48:58,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:58,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:48:58,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:58,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:48:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:48:58,571 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-11-21 13:48:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:59,044 INFO L93 Difference]: Finished difference Result 445 states and 521 transitions. [2022-11-21 13:48:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:48:59,045 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-11-21 13:48:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:59,047 INFO L225 Difference]: With dead ends: 445 [2022-11-21 13:48:59,047 INFO L226 Difference]: Without dead ends: 445 [2022-11-21 13:48:59,047 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-11-21 13:48:59,048 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 246 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:59,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 546 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:48:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-11-21 13:48:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 344. [2022-11-21 13:48:59,054 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-11-21 13:48:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 408 transitions. [2022-11-21 13:48:59,056 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 408 transitions. Word has length 45 [2022-11-21 13:48:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:59,057 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 408 transitions. [2022-11-21 13:48:59,057 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-11-21 13:48:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 408 transitions. [2022-11-21 13:48:59,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 13:48:59,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:59,058 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-11-21 13:48:59,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-21 13:48:59,059 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-11-21 13:48:59,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash 190981617, now seen corresponding path program 1 times [2022-11-21 13:48:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:59,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975207448] [2022-11-21 13:48:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:48:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:59,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975207448] [2022-11-21 13:48:59,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975207448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:59,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:59,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-21 13:48:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211225919] [2022-11-21 13:48:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:59,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 13:48:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:59,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 13:48:59,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:48:59,626 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-11-21 13:49:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:00,474 INFO L93 Difference]: Finished difference Result 371 states and 438 transitions. [2022-11-21 13:49:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 13:49:00,474 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-11-21 13:49:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:00,476 INFO L225 Difference]: With dead ends: 371 [2022-11-21 13:49:00,476 INFO L226 Difference]: Without dead ends: 367 [2022-11-21 13:49:00,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2022-11-21 13:49:00,477 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 509 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:00,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1757 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:49:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-21 13:49:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 345. [2022-11-21 13:49:00,483 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-11-21 13:49:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 408 transitions. [2022-11-21 13:49:00,484 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 408 transitions. Word has length 45 [2022-11-21 13:49:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:00,484 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 408 transitions. [2022-11-21 13:49:00,484 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-11-21 13:49:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 408 transitions. [2022-11-21 13:49:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 13:49:00,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:00,485 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-11-21 13:49:00,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-21 13:49:00,486 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-11-21 13:49:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash 767246721, now seen corresponding path program 2 times [2022-11-21 13:49:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:00,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547610762] [2022-11-21 13:49:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:02,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:02,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547610762] [2022-11-21 13:49:02,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547610762] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:02,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31958069] [2022-11-21 13:49:02,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:49:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:02,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:02,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:49:02,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:49:02,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:49:02,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-21 13:49:02,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:02,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:49:02,910 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:49:02,911 INFO L350 Elim1Store]: Elim1 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-11-21 13:49:03,010 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:49:03,010 INFO L350 Elim1Store]: Elim1 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-11-21 13:49:03,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:49:03,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:03,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-21 13:49:03,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:03,373 INFO L321 Elim1Store]: treesize reduction 30, result has 25.0 percent of original size [2022-11-21 13:49:03,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 45 [2022-11-21 13:49:03,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-11-21 13:49:03,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:49:03,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:03,719 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-21 13:49:03,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 57 [2022-11-21 13:49:03,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 13:49:04,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:04,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:04,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:04,361 INFO L321 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2022-11-21 13:49:04,362 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 61 [2022-11-21 13:49:04,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 13:49:04,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:49:04,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:04,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:04,781 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 13:49:04,782 INFO L350 Elim1Store]: Elim1 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 76 treesize of output 49 [2022-11-21 13:49:04,965 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 22 [2022-11-21 13:49:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:05,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:49:06,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:37,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31958069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:49:37,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:49:37,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 58 [2022-11-21 13:49:37,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435813411] [2022-11-21 13:49:37,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:49:37,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-21 13:49:37,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:37,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-21 13:49:37,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3147, Unknown=6, NotChecked=0, Total=3422 [2022-11-21 13:49:37,321 INFO L87 Difference]: Start difference. First operand 345 states and 408 transitions. Second operand has 59 states, 58 states have (on average 2.103448275862069) internal successors, (122), 59 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:45,704 INFO L93 Difference]: Finished difference Result 389 states and 458 transitions. [2022-11-21 13:49:45,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-21 13:49:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.103448275862069) internal successors, (122), 59 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-21 13:49:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:45,706 INFO L225 Difference]: With dead ends: 389 [2022-11-21 13:49:45,706 INFO L226 Difference]: Without dead ends: 389 [2022-11-21 13:49:45,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=1030, Invalid=5606, Unknown=6, NotChecked=0, Total=6642 [2022-11-21 13:49:45,709 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1053 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 5067 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 5154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 5067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:45,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 4804 Invalid, 5154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 5067 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-21 13:49:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-11-21 13:49:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 344. [2022-11-21 13:49:45,715 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-11-21 13:49:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 407 transitions. [2022-11-21 13:49:45,716 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 407 transitions. Word has length 46 [2022-11-21 13:49:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:45,716 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 407 transitions. [2022-11-21 13:49:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.103448275862069) internal successors, (122), 59 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:49:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 407 transitions. [2022-11-21 13:49:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 13:49:45,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:45,717 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-11-21 13:49:45,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-21 13:49:45,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-21 13:49:45,918 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-11-21 13:49:45,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:45,918 INFO L85 PathProgramCache]: Analyzing trace with hash 767246722, now seen corresponding path program 1 times [2022-11-21 13:49:45,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:45,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844227823] [2022-11-21 13:49:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:45,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:48,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844227823] [2022-11-21 13:49:48,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844227823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:49:48,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967846355] [2022-11-21 13:49:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:49:48,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:49:48,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:49:48,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:49:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-21 13:49:48,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:49:48,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:49:48,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:48,821 INFO L350 Elim1Store]: Elim1 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-11-21 13:49:48,847 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:49:48,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:49:49,064 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-21 13:49:49,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-21 13:49:49,099 INFO L350 Elim1Store]: Elim1 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-11-21 13:49:49,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:49:49,291 INFO L350 Elim1Store]: Elim1 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-11-21 13:49:49,689 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-21 13:49:49,690 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 22 treesize of output 32 [2022-11-21 13:49:49,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:49:49,725 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-21 13:49:49,725 INFO L350 Elim1Store]: Elim1 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 25 [2022-11-21 13:49:49,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2022-11-21 13:49:49,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2022-11-21 13:49:49,992 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 13:49:49,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 57 [2022-11-21 13:49:50,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2022-11-21 13:49:50,198 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-21 13:49:50,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 57 [2022-11-21 13:49:50,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2022-11-21 13:49:50,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:49:50,527 INFO L321 Elim1Store]: treesize reduction 109, result has 9.2 percent of original size [2022-11-21 13:49:50,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 72 [2022-11-21 13:49:50,544 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:49:50,545 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 51 treesize of output 44 [2022-11-21 13:49:50,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2022-11-21 13:49:50,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2022-11-21 13:49:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:49:50,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:03,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:50:03,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:50:19,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 186 [2022-11-21 13:50:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:19,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967846355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:50:19,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:50:19,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 15] total 46 [2022-11-21 13:50:19,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320308198] [2022-11-21 13:50:19,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:19,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-21 13:50:19,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:19,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-21 13:50:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2010, Unknown=0, NotChecked=0, Total=2162 [2022-11-21 13:50:20,000 INFO L87 Difference]: Start difference. First operand 344 states and 407 transitions. Second operand has 47 states, 46 states have (on average 2.760869565217391) internal successors, (127), 47 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:50:43,773 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:50:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:43,875 INFO L93 Difference]: Finished difference Result 506 states and 591 transitions. [2022-11-21 13:50:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:50:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.760869565217391) internal successors, (127), 47 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-11-21 13:50:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:43,878 INFO L225 Difference]: With dead ends: 506 [2022-11-21 13:50:43,878 INFO L226 Difference]: Without dead ends: 506 [2022-11-21 13:50:43,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=629, Invalid=3531, Unknown=0, NotChecked=0, Total=4160 [2022-11-21 13:50:43,880 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 1701 mSDsluCounter, 2841 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:43,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 3013 Invalid, 3921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3827 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-21 13:50:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-11-21 13:50:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 343. [2022-11-21 13:50:43,887 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-11-21 13:50:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 406 transitions. [2022-11-21 13:50:43,888 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 406 transitions. Word has length 46 [2022-11-21 13:50:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:43,889 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 406 transitions. [2022-11-21 13:50:43,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.760869565217391) internal successors, (127), 47 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:50:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 406 transitions. [2022-11-21 13:50:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-21 13:50:43,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:43,890 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-11-21 13:50:43,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:50:44,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:50:44,099 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-11-21 13:50:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2037167036, now seen corresponding path program 1 times [2022-11-21 13:50:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:44,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764513703] [2022-11-21 13:50:44,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:44,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:44,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764513703] [2022-11-21 13:50:44,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764513703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:44,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:44,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 13:50:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113215037] [2022-11-21 13:50:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:44,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 13:50:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 13:50:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:50:44,903 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-11-21 13:50:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:46,303 INFO L93 Difference]: Finished difference Result 480 states and 538 transitions. [2022-11-21 13:50:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 13:50:46,304 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-11-21 13:50:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:46,306 INFO L225 Difference]: With dead ends: 480 [2022-11-21 13:50:46,306 INFO L226 Difference]: Without dead ends: 480 [2022-11-21 13:50:46,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2022-11-21 13:50:46,308 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 1303 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:46,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 817 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 13:50:46,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-11-21 13:50:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 373. [2022-11-21 13:50:46,315 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-11-21 13:50:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 465 transitions. [2022-11-21 13:50:46,317 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 465 transitions. Word has length 48 [2022-11-21 13:50:46,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:46,317 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 465 transitions. [2022-11-21 13:50:46,317 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-11-21 13:50:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 465 transitions. [2022-11-21 13:50:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 13:50:46,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:46,318 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-11-21 13:50:46,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-21 13:50:46,319 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-11-21 13:50:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1246142357, now seen corresponding path program 1 times [2022-11-21 13:50:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:46,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394183338] [2022-11-21 13:50:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:47,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:47,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394183338] [2022-11-21 13:50:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394183338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953367610] [2022-11-21 13:50:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:50:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:50:47,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:50:47,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:50:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:48,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-21 13:50:48,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:48,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:50:48,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:50:48,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 13:50:48,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:50:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 13:50:48,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:50:48,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:50:48,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 13:50:48,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-21 13:50:48,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 13:50:48,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:48,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 13:50:48,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:50:48,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-21 13:50:48,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:50:48,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:50:48,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-21 13:50:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:48,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:50:50,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:50:50,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 13:50:50,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-21 13:50:50,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:50:50,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:50:50,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-21 13:50:50,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:50:50,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-21 13:50:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:50,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953367610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:50:50,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:50:50,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 32 [2022-11-21 13:50:50,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712650110] [2022-11-21 13:50:50,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:50:50,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 13:50:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:50,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 13:50:50,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=884, Unknown=3, NotChecked=0, Total=992 [2022-11-21 13:50:50,176 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-11-21 13:50:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:52,711 INFO L93 Difference]: Finished difference Result 390 states and 482 transitions. [2022-11-21 13:50:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:50:52,712 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-11-21 13:50:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:52,715 INFO L225 Difference]: With dead ends: 390 [2022-11-21 13:50:52,715 INFO L226 Difference]: Without dead ends: 390 [2022-11-21 13:50:52,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=258, Invalid=1631, Unknown=3, NotChecked=0, Total=1892 [2022-11-21 13:50:52,716 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 165 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 3499 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:52,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 3499 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-21 13:50:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-21 13:50:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-21 13:50:52,732 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-11-21 13:50:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 476 transitions. [2022-11-21 13:50:52,733 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 476 transitions. Word has length 51 [2022-11-21 13:50:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:52,734 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 476 transitions. [2022-11-21 13:50:52,735 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-11-21 13:50:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 476 transitions. [2022-11-21 13:50:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 13:50:52,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:52,743 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-11-21 13:50:52,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-21 13:50:52,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-21 13:50:52,951 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-11-21 13:50:52,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash 997414492, now seen corresponding path program 1 times [2022-11-21 13:50:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:52,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731155626] [2022-11-21 13:50:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:50:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:53,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731155626] [2022-11-21 13:50:53,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731155626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:53,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:53,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:50:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202039939] [2022-11-21 13:50:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:53,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:50:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:50:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:50:53,174 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-11-21 13:50:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:53,522 INFO L93 Difference]: Finished difference Result 471 states and 525 transitions. [2022-11-21 13:50:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:50:53,523 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-11-21 13:50:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:53,525 INFO L225 Difference]: With dead ends: 471 [2022-11-21 13:50:53,525 INFO L226 Difference]: Without dead ends: 471 [2022-11-21 13:50:53,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-21 13:50:53,526 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1484 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:53,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 955 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:50:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-11-21 13:50:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 384. [2022-11-21 13:50:53,537 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-11-21 13:50:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 475 transitions. [2022-11-21 13:50:53,539 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 475 transitions. Word has length 53 [2022-11-21 13:50:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:53,539 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 475 transitions. [2022-11-21 13:50:53,540 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-11-21 13:50:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 475 transitions. [2022-11-21 13:50:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-21 13:50:53,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:53,541 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-11-21 13:50:53,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-21 13:50:53,541 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-11-21 13:50:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash -471775986, now seen corresponding path program 1 times [2022-11-21 13:50:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:53,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932156131] [2022-11-21 13:50:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:50:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932156131] [2022-11-21 13:50:57,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932156131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:50:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923403357] [2022-11-21 13:50:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:57,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:50:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:50:57,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:50:57,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_261d823e-4892-472e-ab4f-8073fa384ab7/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:50:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:58,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-21 13:50:58,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:50:58,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:50:58,172 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:50:58,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-21 13:50:58,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:50:58,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:58,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-21 13:50:58,487 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-21 13:50:58,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-21 13:50:58,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-21 13:50:58,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-21 13:50:58,695 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 13:50:58,696 INFO L350 Elim1Store]: Elim1 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-11-21 13:50:58,840 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:50:58,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-11-21 13:50:58,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-21 13:50:58,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 13:50:59,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:50:59,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2022-11-21 13:50:59,521 INFO L321 Elim1Store]: treesize reduction 168, result has 33.6 percent of original size [2022-11-21 13:50:59,522 INFO L350 Elim1Store]: Elim1 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-11-21 13:50:59,898 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 13:50:59,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 66 [2022-11-21 13:50:59,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-21 13:51:00,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:00,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 13:51:00,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:00,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:00,520 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-21 13:51:00,520 INFO L350 Elim1Store]: Elim1 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-11-21 13:51:01,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:01,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:01,739 INFO L321 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-11-21 13:51:01,739 INFO L350 Elim1Store]: Elim1 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-11-21 13:51:01,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:01,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 13:51:02,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:02,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:02,641 INFO L321 Elim1Store]: treesize reduction 59, result has 20.3 percent of original size [2022-11-21 13:51:02,642 INFO L350 Elim1Store]: Elim1 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-11-21 13:51:02,658 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:51:02,659 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 53 treesize of output 46 [2022-11-21 13:51:03,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:51:03,090 INFO L350 Elim1Store]: Elim1 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-11-21 13:51:03,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:51:03,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:51:03,846 INFO L321 Elim1Store]: treesize reduction 112, result has 17.0 percent of original size [2022-11-21 13:51:03,847 INFO L350 Elim1Store]: Elim1 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 175 treesize of output 150 [2022-11-21 13:51:04,585 INFO L321 Elim1Store]: treesize reduction 12, result has 75.5 percent of original size [2022-11-21 13:51:04,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 178 treesize of output 113 [2022-11-21 13:51:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:51:05,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:26,926 WARN L233 SmtUtils]: Spent 38.61s on a formula simplification. DAG size of input: 104 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:52:26,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:52:26,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:26,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:52:26,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:52:26,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:26,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 13:52:26,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:26,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 254 treesize of output 192 [2022-11-21 13:52:27,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:27,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 114 [2022-11-21 13:52:31,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1853 Int) (v_ArrVal_1855 Int) (v_ArrVal_1837 (Array Int Int))) (let ((.cse3 (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_4))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_20| 1)) (.cse4 (store (select .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|))) (let ((.cse1 (let ((.cse5 (store .cse4 4 v_ArrVal_1853))) (let ((.cse6 (select (select (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse5) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4))) (select (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse5 0 .cse6)) .cse6)))) (.cse0 (store .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1))) (or (= (select .cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|)) 1) (not (= (select .cse2 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse0 (select .cse1 v_ArrVal_1855)) 1) (not (= (select .cse0 (select (select (store .cse3 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse4) |v_ULTIMATE.start_main_~item~0#1.base_20|) 0)) 1)) (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_main_~data~0#1.base|))))))) is different from false [2022-11-21 13:52:31,977 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#iter~0#1.base_59| Int) (|v_ULTIMATE.start_main_~item~0#1.base_20| Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_1853 Int) (|v_ULTIMATE.start_main_~node~0#1.base_18| Int) (v_ArrVal_1855 Int) (v_ArrVal_1837 (Array Int Int)) (v_ArrVal_1835 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~node~0#1.base_18| v_ArrVal_1837) |v_ULTIMATE.start_main_~item~0#1.base_20| v_arrayElimArr_4))) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0 |v_ULTIMATE.start_main_~item~0#1.base_20|)) (.cse4 (store (store |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_18| v_ArrVal_1835) |v_ULTIMATE.start_main_~item~0#1.base_20| 1))) (let ((.cse0 (store .cse4 |v_ULTIMATE.start_main_~#iter~0#1.base_59| 1)) (.cse3 (let ((.cse5 (store .cse2 4 v_ArrVal_1853))) (let ((.cse6 (select (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| .cse5) |v_ULTIMATE.start_main_~item~0#1.base_20|) 4))) (select (store .cse1 |v_ULTIMATE.start_main_~#iter~0#1.base_59| (store .cse5 0 .cse6)) .cse6))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~node~0#1.base_18|) 0)) (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (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)) (= (select .cse0 (select .cse3 |c_ULTIMATE.start_main_~item~0#1.offset|)) 1) (not (= (select .cse4 |v_ULTIMATE.start_main_~#iter~0#1.base_59|) 0)) (= (select .cse0 (select .cse3 v_ArrVal_1855)) 1)))))) is different from false [2022-11-21 13:52:32,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:32,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 418 treesize of output 254 [2022-11-21 13:52:32,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:52:32,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:32,599 INFO L350 Elim1Store]: Elim1 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 7055 treesize of output 6837 [2022-11-21 13:52:32,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:32,741 INFO L350 Elim1Store]: Elim1 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 6829 treesize of output 5823 [2022-11-21 13:52:32,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:32,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29451 treesize of output 29155 [2022-11-21 13:52:33,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:52:33,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113303 treesize of output 112159