./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro --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 e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 --- 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-8393723 [2022-11-18 19:37:15,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:37:15,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:37:15,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:37:15,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:37:15,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:37:15,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:37:15,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:37:15,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:37:15,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:37:15,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:37:15,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:37:15,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:37:15,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:37:15,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:37:15,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:37:15,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:37:15,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:37:15,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:37:15,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:37:15,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:37:15,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:37:15,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:37:15,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:37:15,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:37:15,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:37:15,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:37:15,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:37:15,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:37:15,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:37:15,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:37:15,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:37:15,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:37:15,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:37:15,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:37:15,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:37:15,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:37:15,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:37:15,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:37:15,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:37:15,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:37:15,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 19:37:15,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:37:15,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:37:15,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:37:15,690 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:37:15,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:37:15,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:37:15,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:37:15,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:37:15,693 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:37:15,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:37:15,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:37:15,695 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:37:15,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:37:15,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:37:15,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:37:15,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:37:15,696 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:37:15,697 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:37:15,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:37:15,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:37:15,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:37:15,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:37:15,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:37:15,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:37:15,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:37:15,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:37:15,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:37:15,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:37:15,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:37:15,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:37:15,702 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_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/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_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro 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 -> e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 [2022-11-18 19:37:16,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:37:16,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:37:16,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:37:16,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:37:16,060 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:37:16,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2022-11-18 19:37:16,141 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/data/485ef1b80/6500d8b733aa41ed867f61959cdfe3eb/FLAG838f02f50 [2022-11-18 19:37:16,707 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:37:16,708 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2022-11-18 19:37:16,729 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/data/485ef1b80/6500d8b733aa41ed867f61959cdfe3eb/FLAG838f02f50 [2022-11-18 19:37:17,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/data/485ef1b80/6500d8b733aa41ed867f61959cdfe3eb [2022-11-18 19:37:17,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:37:17,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:37:17,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:37:17,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:37:17,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:37:17,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:17,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c89e0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17, skipping insertion in model container [2022-11-18 19:37:17,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:17,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:37:17,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:37:17,640 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c[38357,38370] [2022-11-18 19:37:17,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:37:17,700 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:37:17,912 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c[38357,38370] [2022-11-18 19:37:17,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:37:17,956 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:37:17,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17 WrapperNode [2022-11-18 19:37:17,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:37:17,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:37:17,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:37:17,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:37:17,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:17,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,092 INFO L138 Inliner]: procedures = 17, calls = 620, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2158 [2022-11-18 19:37:18,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:37:18,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:37:18,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:37:18,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:37:18,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:37:18,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:37:18,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:37:18,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:37:18,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (1/1) ... [2022-11-18 19:37:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:37:18,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:37:18,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:37:18,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:37:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:37:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-11-18 19:37:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:37:18,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:37:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:37:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:37:18,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:37:18,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:37:18,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:37:18,658 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:37:18,660 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:37:20,618 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:37:20,632 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:37:20,633 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:37:20,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:37:20 BoogieIcfgContainer [2022-11-18 19:37:20,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:37:20,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:37:20,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:37:20,650 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:37:20,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:37:17" (1/3) ... [2022-11-18 19:37:20,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f1a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:37:20, skipping insertion in model container [2022-11-18 19:37:20,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:37:17" (2/3) ... [2022-11-18 19:37:20,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5f1a33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:37:20, skipping insertion in model container [2022-11-18 19:37:20,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:37:20" (3/3) ... [2022-11-18 19:37:20,654 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+nlh-reducer.c [2022-11-18 19:37:20,684 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:37:20,684 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 168 error locations. [2022-11-18 19:37:20,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:37:20,801 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;@1bc41fb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:37:20,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 168 error locations. [2022-11-18 19:37:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 301 states have (on average 2.129568106312292) internal successors, (641), 469 states have internal predecessors, (641), 0 states have call successors, (0), 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-18 19:37:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:37:20,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:20,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:37:20,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash 926754, now seen corresponding path program 1 times [2022-11-18 19:37:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:20,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195550286] [2022-11-18 19:37:20,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:21,358 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-18 19:37:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195550286] [2022-11-18 19:37:21,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195550286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:21,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:21,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813933919] [2022-11-18 19:37:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:21,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:21,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:21,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:21,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:21,420 INFO L87 Difference]: Start difference. First operand has 470 states, 301 states have (on average 2.129568106312292) internal successors, (641), 469 states have internal predecessors, (641), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-18 19:37:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:22,411 INFO L93 Difference]: Finished difference Result 471 states and 598 transitions. [2022-11-18 19:37:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:22,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-18 19:37:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:22,436 INFO L225 Difference]: With dead ends: 471 [2022-11-18 19:37:22,441 INFO L226 Difference]: Without dead ends: 468 [2022-11-18 19:37:22,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:22,452 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 166 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:22,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1021 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 19:37:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-18 19:37:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-11-18 19:37:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.98) internal successors, (594), 467 states have internal predecessors, (594), 0 states have call successors, (0), 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-18 19:37:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 594 transitions. [2022-11-18 19:37:22,546 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 594 transitions. Word has length 4 [2022-11-18 19:37:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:22,546 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 594 transitions. [2022-11-18 19:37:22,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-18 19:37:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 594 transitions. [2022-11-18 19:37:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:37:22,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:22,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:37:22,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:37:22,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-18 19:37:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:22,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277595354] [2022-11-18 19:37:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:22,725 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-18 19:37:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:22,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277595354] [2022-11-18 19:37:22,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277595354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:22,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:22,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:22,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142447206] [2022-11-18 19:37:22,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:22,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:22,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:22,742 INFO L87 Difference]: Start difference. First operand 468 states and 594 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-18 19:37:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:23,548 INFO L93 Difference]: Finished difference Result 427 states and 553 transitions. [2022-11-18 19:37:23,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:23,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-18 19:37:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:23,552 INFO L225 Difference]: With dead ends: 427 [2022-11-18 19:37:23,552 INFO L226 Difference]: Without dead ends: 427 [2022-11-18 19:37:23,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:23,554 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 841 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:23,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 257 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 19:37:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-11-18 19:37:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-11-18 19:37:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 300 states have (on average 1.8433333333333333) internal successors, (553), 426 states have internal predecessors, (553), 0 states have call successors, (0), 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-18 19:37:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 553 transitions. [2022-11-18 19:37:23,591 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 553 transitions. Word has length 4 [2022-11-18 19:37:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:23,591 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 553 transitions. [2022-11-18 19:37:23,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-18 19:37:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 553 transitions. [2022-11-18 19:37:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 19:37:23,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:23,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 19:37:23,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:37:23,593 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-11-18 19:37:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:23,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028859708] [2022-11-18 19:37:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:23,819 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-18 19:37:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:23,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028859708] [2022-11-18 19:37:23,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028859708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:23,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:23,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597898786] [2022-11-18 19:37:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:23,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:23,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:23,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:23,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:23,825 INFO L87 Difference]: Start difference. First operand 427 states and 553 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-18 19:37:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:24,518 INFO L93 Difference]: Finished difference Result 386 states and 512 transitions. [2022-11-18 19:37:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:24,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-18 19:37:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:24,520 INFO L225 Difference]: With dead ends: 386 [2022-11-18 19:37:24,521 INFO L226 Difference]: Without dead ends: 386 [2022-11-18 19:37:24,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:24,523 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 888 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:24,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 258 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:37:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-18 19:37:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-18 19:37:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 385 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 19:37:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 512 transitions. [2022-11-18 19:37:24,537 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 512 transitions. Word has length 4 [2022-11-18 19:37:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:24,538 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 512 transitions. [2022-11-18 19:37:24,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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-18 19:37:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 512 transitions. [2022-11-18 19:37:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-18 19:37:24,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:24,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:24,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:37:24,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash 619918515, now seen corresponding path program 1 times [2022-11-18 19:37:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:24,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071128801] [2022-11-18 19:37:24,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:24,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:25,051 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-18 19:37:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:25,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071128801] [2022-11-18 19:37:25,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071128801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:25,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:25,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096993721] [2022-11-18 19:37:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:25,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:37:25,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:37:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:37:25,056 INFO L87 Difference]: Start difference. First operand 386 states and 512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:25,396 INFO L93 Difference]: Finished difference Result 388 states and 512 transitions. [2022-11-18 19:37:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:37:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-11-18 19:37:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:25,401 INFO L225 Difference]: With dead ends: 388 [2022-11-18 19:37:25,401 INFO L226 Difference]: Without dead ends: 388 [2022-11-18 19:37:25,402 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-18 19:37:25,403 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 91 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:25,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 760 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-11-18 19:37:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2022-11-18 19:37:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7033333333333334) internal successors, (511), 385 states have internal predecessors, (511), 0 states have call successors, (0), 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-18 19:37:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2022-11-18 19:37:25,418 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 88 [2022-11-18 19:37:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:25,419 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2022-11-18 19:37:25,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2022-11-18 19:37:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-18 19:37:25,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:25,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:25,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:37:25,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:25,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2036638706, now seen corresponding path program 1 times [2022-11-18 19:37:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:25,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008172055] [2022-11-18 19:37:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:25,699 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-18 19:37:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:25,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008172055] [2022-11-18 19:37:25,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008172055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:25,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:25,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986721023] [2022-11-18 19:37:25,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:25,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:37:25,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:25,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:37:25,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:37:25,704 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-18 19:37:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:25,717 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2022-11-18 19:37:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:37:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-11-18 19:37:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:25,720 INFO L225 Difference]: With dead ends: 386 [2022-11-18 19:37:25,721 INFO L226 Difference]: Without dead ends: 386 [2022-11-18 19:37:25,721 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-18 19:37:25,722 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 423 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:25,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 594 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:37:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-18 19:37:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-18 19:37:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7) internal successors, (510), 385 states have internal predecessors, (510), 0 states have call successors, (0), 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-18 19:37:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2022-11-18 19:37:25,734 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 89 [2022-11-18 19:37:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:25,735 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2022-11-18 19:37:25,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-18 19:37:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2022-11-18 19:37:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-18 19:37:25,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:25,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:25,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:37:25,739 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637796, now seen corresponding path program 1 times [2022-11-18 19:37:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:25,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017603185] [2022-11-18 19:37:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:26,135 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-18 19:37:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:26,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017603185] [2022-11-18 19:37:26,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017603185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:26,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:26,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263829754] [2022-11-18 19:37:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:26,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:26,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:26,139 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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-18 19:37:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:26,864 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-11-18 19:37:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:26,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-11-18 19:37:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:26,867 INFO L225 Difference]: With dead ends: 385 [2022-11-18 19:37:26,867 INFO L226 Difference]: Without dead ends: 385 [2022-11-18 19:37:26,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:26,869 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 589 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:26,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 341 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:37:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-11-18 19:37:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2022-11-18 19:37:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 300 states have (on average 1.6966666666666668) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 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-18 19:37:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-11-18 19:37:26,879 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 89 [2022-11-18 19:37:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:26,880 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-11-18 19:37:26,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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-18 19:37:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-11-18 19:37:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-18 19:37:26,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:26,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:26,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:37:26,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637797, now seen corresponding path program 1 times [2022-11-18 19:37:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:26,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589777525] [2022-11-18 19:37:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:27,691 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-18 19:37:27,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:27,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589777525] [2022-11-18 19:37:27,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589777525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:27,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:27,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:27,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575965893] [2022-11-18 19:37:27,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:27,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:27,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:27,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:27,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:27,695 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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-18 19:37:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:28,940 INFO L93 Difference]: Finished difference Result 384 states and 508 transitions. [2022-11-18 19:37:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:37:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2022-11-18 19:37:28,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:28,944 INFO L225 Difference]: With dead ends: 384 [2022-11-18 19:37:28,944 INFO L226 Difference]: Without dead ends: 384 [2022-11-18 19:37:28,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-18 19:37:28,946 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 882 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:28,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 426 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 19:37:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-18 19:37:28,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-11-18 19:37:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 300 states have (on average 1.6933333333333334) internal successors, (508), 383 states have internal predecessors, (508), 0 states have call successors, (0), 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-18 19:37:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 508 transitions. [2022-11-18 19:37:28,957 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 508 transitions. Word has length 89 [2022-11-18 19:37:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:28,958 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 508 transitions. [2022-11-18 19:37:28,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 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-18 19:37:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 508 transitions. [2022-11-18 19:37:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-18 19:37:28,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:28,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:28,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:37:28,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:28,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1296129175, now seen corresponding path program 1 times [2022-11-18 19:37:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:28,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608115572] [2022-11-18 19:37:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:30,119 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-18 19:37:30,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:30,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608115572] [2022-11-18 19:37:30,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608115572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:30,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:30,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:37:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389521589] [2022-11-18 19:37:30,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:30,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:37:30,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:30,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:37:30,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:37:30,126 INFO L87 Difference]: Start difference. First operand 384 states and 508 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-18 19:37:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:31,283 INFO L93 Difference]: Finished difference Result 383 states and 507 transitions. [2022-11-18 19:37:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:37:31,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-18 19:37:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:31,286 INFO L225 Difference]: With dead ends: 383 [2022-11-18 19:37:31,286 INFO L226 Difference]: Without dead ends: 382 [2022-11-18 19:37:31,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:37:31,287 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 539 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:31,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 675 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 19:37:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-18 19:37:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-11-18 19:37:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 299 states have (on average 1.274247491638796) internal successors, (381), 381 states have internal predecessors, (381), 0 states have call successors, (0), 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-18 19:37:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 381 transitions. [2022-11-18 19:37:31,297 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 381 transitions. Word has length 91 [2022-11-18 19:37:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:31,298 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 381 transitions. [2022-11-18 19:37:31,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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-18 19:37:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 381 transitions. [2022-11-18 19:37:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-18 19:37:31,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:31,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:31,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:37:31,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244098, now seen corresponding path program 1 times [2022-11-18 19:37:31,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:31,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835722699] [2022-11-18 19:37:31,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:31,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:31,608 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-18 19:37:31,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:31,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835722699] [2022-11-18 19:37:31,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835722699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:31,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:31,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564692238] [2022-11-18 19:37:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:31,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:31,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:31,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:31,612 INFO L87 Difference]: Start difference. First operand 382 states and 381 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:31,954 INFO L93 Difference]: Finished difference Result 381 states and 380 transitions. [2022-11-18 19:37:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:31,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-11-18 19:37:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:31,957 INFO L225 Difference]: With dead ends: 381 [2022-11-18 19:37:31,957 INFO L226 Difference]: Without dead ends: 381 [2022-11-18 19:37:31,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 19:37:31,958 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 870 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:31,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 426 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:31,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-18 19:37:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-11-18 19:37:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 299 states have (on average 1.2709030100334449) internal successors, (380), 380 states have internal predecessors, (380), 0 states have call successors, (0), 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-18 19:37:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 380 transitions. [2022-11-18 19:37:31,968 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 380 transitions. Word has length 94 [2022-11-18 19:37:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:31,968 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 380 transitions. [2022-11-18 19:37:31,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 380 transitions. [2022-11-18 19:37:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-18 19:37:31,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:31,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:31,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:37:31,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:31,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244097, now seen corresponding path program 1 times [2022-11-18 19:37:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:31,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552269835] [2022-11-18 19:37:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:32,630 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-18 19:37:32,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:32,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552269835] [2022-11-18 19:37:32,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552269835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:32,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:32,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159822508] [2022-11-18 19:37:32,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:32,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:32,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:32,639 INFO L87 Difference]: Start difference. First operand 381 states and 380 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:33,373 INFO L93 Difference]: Finished difference Result 380 states and 379 transitions. [2022-11-18 19:37:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:37:33,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-11-18 19:37:33,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:33,377 INFO L225 Difference]: With dead ends: 380 [2022-11-18 19:37:33,377 INFO L226 Difference]: Without dead ends: 380 [2022-11-18 19:37:33,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-18 19:37:33,378 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 740 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:33,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 424 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:37:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-18 19:37:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-18 19:37:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 299 states have (on average 1.2675585284280937) internal successors, (379), 379 states have internal predecessors, (379), 0 states have call successors, (0), 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-18 19:37:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 379 transitions. [2022-11-18 19:37:33,389 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 379 transitions. Word has length 94 [2022-11-18 19:37:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:33,389 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 379 transitions. [2022-11-18 19:37:33,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 379 transitions. [2022-11-18 19:37:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 19:37:33,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:33,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:33,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:37:33,393 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash -837057419, now seen corresponding path program 1 times [2022-11-18 19:37:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:33,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477577725] [2022-11-18 19:37:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:33,740 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-18 19:37:33,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:33,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477577725] [2022-11-18 19:37:33,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477577725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:33,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:33,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:33,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915457400] [2022-11-18 19:37:33,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:33,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:33,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:33,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:33,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:33,744 INFO L87 Difference]: Start difference. First operand 380 states and 379 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:34,100 INFO L93 Difference]: Finished difference Result 379 states and 378 transitions. [2022-11-18 19:37:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-18 19:37:34,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:34,103 INFO L225 Difference]: With dead ends: 379 [2022-11-18 19:37:34,103 INFO L226 Difference]: Without dead ends: 379 [2022-11-18 19:37:34,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 19:37:34,105 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 854 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:34,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 428 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-18 19:37:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2022-11-18 19:37:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 299 states have (on average 1.2642140468227425) internal successors, (378), 378 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-18 19:37:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 378 transitions. [2022-11-18 19:37:34,113 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 378 transitions. Word has length 99 [2022-11-18 19:37:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:34,114 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 378 transitions. [2022-11-18 19:37:34,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 378 transitions. [2022-11-18 19:37:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-18 19:37:34,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:34,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:34,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:37:34,116 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash -837057418, now seen corresponding path program 1 times [2022-11-18 19:37:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:34,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049566489] [2022-11-18 19:37:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:34,841 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-18 19:37:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:34,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049566489] [2022-11-18 19:37:34,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049566489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:34,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:34,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:37:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410870506] [2022-11-18 19:37:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:34,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:37:34,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:34,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:37:34,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:37:34,844 INFO L87 Difference]: Start difference. First operand 379 states and 378 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:35,642 INFO L93 Difference]: Finished difference Result 378 states and 377 transitions. [2022-11-18 19:37:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:35,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-11-18 19:37:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:35,645 INFO L225 Difference]: With dead ends: 378 [2022-11-18 19:37:35,645 INFO L226 Difference]: Without dead ends: 378 [2022-11-18 19:37:35,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:37:35,646 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 1009 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:35,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 429 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:37:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-18 19:37:35,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-11-18 19:37:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 377 states have internal predecessors, (377), 0 states have call successors, (0), 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-18 19:37:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 377 transitions. [2022-11-18 19:37:35,657 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 377 transitions. Word has length 99 [2022-11-18 19:37:35,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:35,657 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 377 transitions. [2022-11-18 19:37:35,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 377 transitions. [2022-11-18 19:37:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 19:37:35,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:35,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:35,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:37:35,660 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -586464657, now seen corresponding path program 1 times [2022-11-18 19:37:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:35,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180307024] [2022-11-18 19:37:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:35,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:35,994 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-18 19:37:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:35,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180307024] [2022-11-18 19:37:35,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180307024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:35,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:35,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711749359] [2022-11-18 19:37:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:35,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:35,998 INFO L87 Difference]: Start difference. First operand 378 states and 377 transitions. Second operand has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:36,329 INFO L93 Difference]: Finished difference Result 377 states and 376 transitions. [2022-11-18 19:37:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:36,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-11-18 19:37:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:36,332 INFO L225 Difference]: With dead ends: 377 [2022-11-18 19:37:36,332 INFO L226 Difference]: Without dead ends: 377 [2022-11-18 19:37:36,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 19:37:36,333 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 838 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:36,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 430 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-18 19:37:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-18 19:37:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 299 states have (on average 1.2575250836120402) internal successors, (376), 376 states have internal predecessors, (376), 0 states have call successors, (0), 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-18 19:37:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 376 transitions. [2022-11-18 19:37:36,343 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 376 transitions. Word has length 104 [2022-11-18 19:37:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:36,344 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 376 transitions. [2022-11-18 19:37:36,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 376 transitions. [2022-11-18 19:37:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-18 19:37:36,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:36,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:36,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 19:37:36,346 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:36,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash -586464656, now seen corresponding path program 1 times [2022-11-18 19:37:36,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:36,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446393113] [2022-11-18 19:37:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:37,123 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-18 19:37:37,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:37,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446393113] [2022-11-18 19:37:37,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446393113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:37,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:37,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:37:37,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354083520] [2022-11-18 19:37:37,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:37,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:37:37,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:37,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:37:37,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:37:37,127 INFO L87 Difference]: Start difference. First operand 377 states and 376 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:37,951 INFO L93 Difference]: Finished difference Result 376 states and 375 transitions. [2022-11-18 19:37:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:37,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-11-18 19:37:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:37,954 INFO L225 Difference]: With dead ends: 376 [2022-11-18 19:37:37,954 INFO L226 Difference]: Without dead ends: 376 [2022-11-18 19:37:37,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:37:37,955 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 1006 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:37,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 472 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:37:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-18 19:37:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2022-11-18 19:37:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 299 states have (on average 1.254180602006689) internal successors, (375), 375 states have internal predecessors, (375), 0 states have call successors, (0), 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-18 19:37:37,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 375 transitions. [2022-11-18 19:37:37,964 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 375 transitions. Word has length 104 [2022-11-18 19:37:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:37,965 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 375 transitions. [2022-11-18 19:37:37,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 375 transitions. [2022-11-18 19:37:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-18 19:37:37,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:37,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:37,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:37:37,968 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash -84099962, now seen corresponding path program 1 times [2022-11-18 19:37:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:37,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319386952] [2022-11-18 19:37:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:38,310 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-18 19:37:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319386952] [2022-11-18 19:37:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319386952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:38,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:38,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847887074] [2022-11-18 19:37:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:38,313 INFO L87 Difference]: Start difference. First operand 376 states and 375 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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-18 19:37:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:38,656 INFO L93 Difference]: Finished difference Result 375 states and 374 transitions. [2022-11-18 19:37:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-11-18 19:37:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:38,658 INFO L225 Difference]: With dead ends: 375 [2022-11-18 19:37:38,659 INFO L226 Difference]: Without dead ends: 375 [2022-11-18 19:37:38,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 19:37:38,660 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 822 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:38,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 432 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-18 19:37:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2022-11-18 19:37:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 299 states have (on average 1.2508361204013378) internal successors, (374), 374 states have internal predecessors, (374), 0 states have call successors, (0), 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-18 19:37:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 374 transitions. [2022-11-18 19:37:38,673 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 374 transitions. Word has length 109 [2022-11-18 19:37:38,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:38,674 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 374 transitions. [2022-11-18 19:37:38,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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-18 19:37:38,674 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 374 transitions. [2022-11-18 19:37:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-18 19:37:38,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:38,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:38,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 19:37:38,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash -84099961, now seen corresponding path program 1 times [2022-11-18 19:37:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:38,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084929445] [2022-11-18 19:37:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:39,518 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-18 19:37:39,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:39,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084929445] [2022-11-18 19:37:39,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084929445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:39,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:39,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:37:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357046544] [2022-11-18 19:37:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:39,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:37:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:39,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:37:39,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:37:39,522 INFO L87 Difference]: Start difference. First operand 375 states and 374 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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-18 19:37:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:40,297 INFO L93 Difference]: Finished difference Result 374 states and 373 transitions. [2022-11-18 19:37:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:40,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-11-18 19:37:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:40,300 INFO L225 Difference]: With dead ends: 374 [2022-11-18 19:37:40,300 INFO L226 Difference]: Without dead ends: 374 [2022-11-18 19:37:40,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:37:40,301 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1261 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:40,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 433 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:37:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-18 19:37:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-11-18 19:37:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 299 states have (on average 1.2474916387959867) internal successors, (373), 373 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-18 19:37:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 373 transitions. [2022-11-18 19:37:40,310 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 373 transitions. Word has length 109 [2022-11-18 19:37:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:40,311 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 373 transitions. [2022-11-18 19:37:40,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 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-18 19:37:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 373 transitions. [2022-11-18 19:37:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-18 19:37:40,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:40,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:40,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 19:37:40,314 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073504, now seen corresponding path program 1 times [2022-11-18 19:37:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:40,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55281632] [2022-11-18 19:37:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:40,627 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-18 19:37:40,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:40,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55281632] [2022-11-18 19:37:40,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55281632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:40,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:40,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033294439] [2022-11-18 19:37:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:40,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:40,631 INFO L87 Difference]: Start difference. First operand 374 states and 373 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 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-18 19:37:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:40,974 INFO L93 Difference]: Finished difference Result 373 states and 372 transitions. [2022-11-18 19:37:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:40,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-11-18 19:37:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:40,976 INFO L225 Difference]: With dead ends: 373 [2022-11-18 19:37:40,976 INFO L226 Difference]: Without dead ends: 373 [2022-11-18 19:37:40,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 19:37:40,977 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 806 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:40,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 434 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-18 19:37:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2022-11-18 19:37:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 299 states have (on average 1.2441471571906355) internal successors, (372), 372 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-18 19:37:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 372 transitions. [2022-11-18 19:37:40,986 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 372 transitions. Word has length 114 [2022-11-18 19:37:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:40,987 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 372 transitions. [2022-11-18 19:37:40,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 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-18 19:37:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 372 transitions. [2022-11-18 19:37:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-18 19:37:40,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:40,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:40,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 19:37:40,989 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073505, now seen corresponding path program 1 times [2022-11-18 19:37:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:40,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057904651] [2022-11-18 19:37:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:41,722 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-18 19:37:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057904651] [2022-11-18 19:37:41,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057904651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:41,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:41,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:37:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246343874] [2022-11-18 19:37:41,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:41,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:37:41,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:37:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:37:41,726 INFO L87 Difference]: Start difference. First operand 373 states and 372 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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-18 19:37:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:42,530 INFO L93 Difference]: Finished difference Result 372 states and 371 transitions. [2022-11-18 19:37:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:42,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-11-18 19:37:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:42,532 INFO L225 Difference]: With dead ends: 372 [2022-11-18 19:37:42,533 INFO L226 Difference]: Without dead ends: 372 [2022-11-18 19:37:42,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:37:42,533 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 695 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:42,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 476 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:37:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-18 19:37:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2022-11-18 19:37:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 299 states have (on average 1.2408026755852843) internal successors, (371), 371 states have internal predecessors, (371), 0 states have call successors, (0), 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-18 19:37:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 371 transitions. [2022-11-18 19:37:42,542 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 371 transitions. Word has length 114 [2022-11-18 19:37:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:42,543 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 371 transitions. [2022-11-18 19:37:42,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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-18 19:37:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 371 transitions. [2022-11-18 19:37:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-18 19:37:42,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:42,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:42,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:37:42,546 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:42,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:42,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157079, now seen corresponding path program 1 times [2022-11-18 19:37:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:42,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510115910] [2022-11-18 19:37:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:42,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:42,914 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-18 19:37:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:42,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510115910] [2022-11-18 19:37:42,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510115910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:42,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:42,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:42,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100022372] [2022-11-18 19:37:42,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:42,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:42,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:42,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:42,920 INFO L87 Difference]: Start difference. First operand 372 states and 371 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:43,293 INFO L93 Difference]: Finished difference Result 371 states and 370 transitions. [2022-11-18 19:37:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:43,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-11-18 19:37:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:43,295 INFO L225 Difference]: With dead ends: 371 [2022-11-18 19:37:43,295 INFO L226 Difference]: Without dead ends: 371 [2022-11-18 19:37:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 19:37:43,296 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 790 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:43,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 436 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-18 19:37:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2022-11-18 19:37:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 299 states have (on average 1.2374581939799332) internal successors, (370), 370 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 370 transitions. [2022-11-18 19:37:43,309 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 370 transitions. Word has length 119 [2022-11-18 19:37:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:43,310 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 370 transitions. [2022-11-18 19:37:43,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 370 transitions. [2022-11-18 19:37:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-18 19:37:43,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:43,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:43,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 19:37:43,314 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:43,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157080, now seen corresponding path program 1 times [2022-11-18 19:37:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804748494] [2022-11-18 19:37:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:44,109 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-18 19:37:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:44,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804748494] [2022-11-18 19:37:44,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804748494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:44,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:44,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:37:44,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810206047] [2022-11-18 19:37:44,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:44,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:37:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:44,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:37:44,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:37:44,113 INFO L87 Difference]: Start difference. First operand 371 states and 370 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:44,919 INFO L93 Difference]: Finished difference Result 370 states and 369 transitions. [2022-11-18 19:37:44,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:44,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-11-18 19:37:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:44,923 INFO L225 Difference]: With dead ends: 370 [2022-11-18 19:37:44,923 INFO L226 Difference]: Without dead ends: 370 [2022-11-18 19:37:44,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:37:44,924 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 937 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:44,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 437 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:37:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-18 19:37:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-11-18 19:37:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.234113712374582) internal successors, (369), 369 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 369 transitions. [2022-11-18 19:37:44,933 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 369 transitions. Word has length 119 [2022-11-18 19:37:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:44,934 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 369 transitions. [2022-11-18 19:37:44,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 369 transitions. [2022-11-18 19:37:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 19:37:44,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:44,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:44,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 19:37:44,937 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash 345305810, now seen corresponding path program 1 times [2022-11-18 19:37:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:44,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935871759] [2022-11-18 19:37:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:45,717 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-18 19:37:45,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:45,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935871759] [2022-11-18 19:37:45,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935871759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:45,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:45,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:37:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073876058] [2022-11-18 19:37:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:45,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:37:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:45,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:37:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:37:45,722 INFO L87 Difference]: Start difference. First operand 370 states and 369 transitions. Second operand has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:46,506 INFO L93 Difference]: Finished difference Result 369 states and 368 transitions. [2022-11-18 19:37:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:46,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-11-18 19:37:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:46,509 INFO L225 Difference]: With dead ends: 369 [2022-11-18 19:37:46,509 INFO L226 Difference]: Without dead ends: 369 [2022-11-18 19:37:46,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:37:46,510 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 676 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:46,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 480 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:37:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-18 19:37:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-11-18 19:37:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 299 states have (on average 1.2307692307692308) internal successors, (368), 368 states have internal predecessors, (368), 0 states have call successors, (0), 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-18 19:37:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 368 transitions. [2022-11-18 19:37:46,521 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 368 transitions. Word has length 124 [2022-11-18 19:37:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:46,521 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 368 transitions. [2022-11-18 19:37:46,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 368 transitions. [2022-11-18 19:37:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-18 19:37:46,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:46,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:46,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 19:37:46,524 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash 345305809, now seen corresponding path program 1 times [2022-11-18 19:37:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:46,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451910452] [2022-11-18 19:37:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:46,885 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-18 19:37:46,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:46,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451910452] [2022-11-18 19:37:46,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451910452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:46,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:46,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:37:46,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599735630] [2022-11-18 19:37:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:46,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:37:46,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:46,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:37:46,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:37:46,888 INFO L87 Difference]: Start difference. First operand 369 states and 368 transitions. Second operand has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:47,238 INFO L93 Difference]: Finished difference Result 368 states and 367 transitions. [2022-11-18 19:37:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:37:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-11-18 19:37:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:47,241 INFO L225 Difference]: With dead ends: 368 [2022-11-18 19:37:47,241 INFO L226 Difference]: Without dead ends: 368 [2022-11-18 19:37:47,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-18 19:37:47,242 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 771 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:47,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 438 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-11-18 19:37:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-11-18 19:37:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 299 states have (on average 1.2274247491638797) internal successors, (367), 367 states have internal predecessors, (367), 0 states have call successors, (0), 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-18 19:37:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 367 transitions. [2022-11-18 19:37:47,251 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 367 transitions. Word has length 124 [2022-11-18 19:37:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:47,251 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 367 transitions. [2022-11-18 19:37:47,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 367 transitions. [2022-11-18 19:37:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-18 19:37:47,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:47,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:47,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 19:37:47,254 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:47,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash 286927016, now seen corresponding path program 1 times [2022-11-18 19:37:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:47,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641886502] [2022-11-18 19:37:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:47,614 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-18 19:37:47,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:47,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641886502] [2022-11-18 19:37:47,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641886502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:47,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:47,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851132436] [2022-11-18 19:37:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:47,619 INFO L87 Difference]: Start difference. First operand 368 states and 367 transitions. Second operand has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-18 19:37:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:47,946 INFO L93 Difference]: Finished difference Result 367 states and 366 transitions. [2022-11-18 19:37:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2022-11-18 19:37:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:47,949 INFO L225 Difference]: With dead ends: 367 [2022-11-18 19:37:47,949 INFO L226 Difference]: Without dead ends: 367 [2022-11-18 19:37:47,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:47,950 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 477 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:47,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 355 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:47,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-18 19:37:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-11-18 19:37:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 299 states have (on average 1.2240802675585285) internal successors, (366), 366 states have internal predecessors, (366), 0 states have call successors, (0), 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-18 19:37:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 366 transitions. [2022-11-18 19:37:47,958 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 366 transitions. Word has length 129 [2022-11-18 19:37:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:47,958 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 366 transitions. [2022-11-18 19:37:47,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-18 19:37:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 366 transitions. [2022-11-18 19:37:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-18 19:37:47,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:47,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:47,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 19:37:47,961 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 286927017, now seen corresponding path program 1 times [2022-11-18 19:37:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930653145] [2022-11-18 19:37:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:48,806 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-18 19:37:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:48,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930653145] [2022-11-18 19:37:48,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930653145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:48,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:48,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:37:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605273607] [2022-11-18 19:37:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:48,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:37:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:37:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:37:48,809 INFO L87 Difference]: Start difference. First operand 367 states and 366 transitions. Second operand has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 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-18 19:37:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:49,613 INFO L93 Difference]: Finished difference Result 366 states and 365 transitions. [2022-11-18 19:37:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2022-11-18 19:37:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:49,616 INFO L225 Difference]: With dead ends: 366 [2022-11-18 19:37:49,616 INFO L226 Difference]: Without dead ends: 366 [2022-11-18 19:37:49,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:37:49,617 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 670 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:49,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 482 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:37:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-18 19:37:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-11-18 19:37:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 299 states have (on average 1.2207357859531773) internal successors, (365), 365 states have internal predecessors, (365), 0 states have call successors, (0), 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-18 19:37:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 365 transitions. [2022-11-18 19:37:49,626 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 365 transitions. Word has length 129 [2022-11-18 19:37:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:49,627 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 365 transitions. [2022-11-18 19:37:49,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 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-18 19:37:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 365 transitions. [2022-11-18 19:37:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-18 19:37:49,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:49,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:49,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 19:37:49,630 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash 6786306, now seen corresponding path program 1 times [2022-11-18 19:37:49,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:49,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619152119] [2022-11-18 19:37:49,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:49,997 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-18 19:37:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:49,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619152119] [2022-11-18 19:37:49,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619152119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:49,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:50,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:50,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712846984] [2022-11-18 19:37:50,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:50,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:50,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:50,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:50,002 INFO L87 Difference]: Start difference. First operand 366 states and 365 transitions. Second operand has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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-18 19:37:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:50,338 INFO L93 Difference]: Finished difference Result 365 states and 364 transitions. [2022-11-18 19:37:50,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-11-18 19:37:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:50,340 INFO L225 Difference]: With dead ends: 365 [2022-11-18 19:37:50,340 INFO L226 Difference]: Without dead ends: 365 [2022-11-18 19:37:50,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:50,341 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 463 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:50,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 357 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-18 19:37:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-18 19:37:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 299 states have (on average 1.2173913043478262) internal successors, (364), 364 states have internal predecessors, (364), 0 states have call successors, (0), 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-18 19:37:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 364 transitions. [2022-11-18 19:37:50,357 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 364 transitions. Word has length 134 [2022-11-18 19:37:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:50,357 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 364 transitions. [2022-11-18 19:37:50,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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-18 19:37:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 364 transitions. [2022-11-18 19:37:50,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-18 19:37:50,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:50,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:50,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 19:37:50,360 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 6786307, now seen corresponding path program 1 times [2022-11-18 19:37:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:50,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357861087] [2022-11-18 19:37:50,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:50,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:51,254 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-18 19:37:51,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:51,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357861087] [2022-11-18 19:37:51,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357861087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:51,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:51,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:37:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646481896] [2022-11-18 19:37:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:51,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:37:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:37:51,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:37:51,258 INFO L87 Difference]: Start difference. First operand 365 states and 364 transitions. Second operand has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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-18 19:37:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:52,071 INFO L93 Difference]: Finished difference Result 364 states and 363 transitions. [2022-11-18 19:37:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:52,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-11-18 19:37:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:52,074 INFO L225 Difference]: With dead ends: 364 [2022-11-18 19:37:52,074 INFO L226 Difference]: Without dead ends: 364 [2022-11-18 19:37:52,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:37:52,075 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 928 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:52,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 484 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:37:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-18 19:37:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-11-18 19:37:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 299 states have (on average 1.214046822742475) internal successors, (363), 363 states have internal predecessors, (363), 0 states have call successors, (0), 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-18 19:37:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 363 transitions. [2022-11-18 19:37:52,089 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 363 transitions. Word has length 134 [2022-11-18 19:37:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:52,090 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 363 transitions. [2022-11-18 19:37:52,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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-18 19:37:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 363 transitions. [2022-11-18 19:37:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-18 19:37:52,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:52,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:52,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 19:37:52,093 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash -664511303, now seen corresponding path program 1 times [2022-11-18 19:37:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:52,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937804752] [2022-11-18 19:37:52,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:52,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:52,425 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-18 19:37:52,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:52,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937804752] [2022-11-18 19:37:52,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937804752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:52,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:52,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:52,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43883222] [2022-11-18 19:37:52,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:52,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:52,428 INFO L87 Difference]: Start difference. First operand 364 states and 363 transitions. Second operand has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:52,748 INFO L93 Difference]: Finished difference Result 363 states and 362 transitions. [2022-11-18 19:37:52,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:52,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-11-18 19:37:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:52,751 INFO L225 Difference]: With dead ends: 363 [2022-11-18 19:37:52,753 INFO L226 Difference]: Without dead ends: 363 [2022-11-18 19:37:52,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:52,755 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 449 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:52,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 359 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-11-18 19:37:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-11-18 19:37:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 299 states have (on average 1.2107023411371238) internal successors, (362), 362 states have internal predecessors, (362), 0 states have call successors, (0), 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-18 19:37:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 362 transitions. [2022-11-18 19:37:52,764 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 362 transitions. Word has length 139 [2022-11-18 19:37:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:52,764 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 362 transitions. [2022-11-18 19:37:52,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 362 transitions. [2022-11-18 19:37:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-18 19:37:52,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:52,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:52,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 19:37:52,767 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -664511302, now seen corresponding path program 1 times [2022-11-18 19:37:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:52,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006029456] [2022-11-18 19:37:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:53,581 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-18 19:37:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006029456] [2022-11-18 19:37:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006029456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:53,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:53,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:37:53,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384631121] [2022-11-18 19:37:53,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:53,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:37:53,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:53,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:37:53,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:37:53,587 INFO L87 Difference]: Start difference. First operand 363 states and 362 transitions. Second operand has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:54,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:54,360 INFO L93 Difference]: Finished difference Result 362 states and 361 transitions. [2022-11-18 19:37:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-11-18 19:37:54,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:54,363 INFO L225 Difference]: With dead ends: 362 [2022-11-18 19:37:54,363 INFO L226 Difference]: Without dead ends: 362 [2022-11-18 19:37:54,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:37:54,363 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 640 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:54,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 486 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:37:54,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-18 19:37:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-11-18 19:37:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 299 states have (on average 1.2073578595317727) internal successors, (361), 361 states have internal predecessors, (361), 0 states have call successors, (0), 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-18 19:37:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 361 transitions. [2022-11-18 19:37:54,381 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 361 transitions. Word has length 139 [2022-11-18 19:37:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:54,381 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 361 transitions. [2022-11-18 19:37:54,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 361 transitions. [2022-11-18 19:37:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-18 19:37:54,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:54,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:54,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-18 19:37:54,384 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:54,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash 307188531, now seen corresponding path program 1 times [2022-11-18 19:37:54,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:54,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457662589] [2022-11-18 19:37:54,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:54,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:54,685 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-18 19:37:54,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:54,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457662589] [2022-11-18 19:37:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457662589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:54,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:54,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:54,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600365368] [2022-11-18 19:37:54,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:54,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:54,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:54,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:54,689 INFO L87 Difference]: Start difference. First operand 362 states and 361 transitions. Second operand has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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-18 19:37:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:55,008 INFO L93 Difference]: Finished difference Result 361 states and 360 transitions. [2022-11-18 19:37:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:55,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2022-11-18 19:37:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:55,011 INFO L225 Difference]: With dead ends: 361 [2022-11-18 19:37:55,011 INFO L226 Difference]: Without dead ends: 361 [2022-11-18 19:37:55,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:55,012 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 435 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:55,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 361 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-18 19:37:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2022-11-18 19:37:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 299 states have (on average 1.2040133779264215) internal successors, (360), 360 states have internal predecessors, (360), 0 states have call successors, (0), 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-18 19:37:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 360 transitions. [2022-11-18 19:37:55,020 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 360 transitions. Word has length 144 [2022-11-18 19:37:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:55,021 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 360 transitions. [2022-11-18 19:37:55,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 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-18 19:37:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 360 transitions. [2022-11-18 19:37:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-18 19:37:55,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:55,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:55,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-18 19:37:55,024 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 307188532, now seen corresponding path program 1 times [2022-11-18 19:37:55,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:55,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40447665] [2022-11-18 19:37:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:55,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:55,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-18 19:37:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:55,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40447665] [2022-11-18 19:37:55,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40447665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:55,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:55,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:37:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731836347] [2022-11-18 19:37:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:55,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:37:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:37:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:37:55,873 INFO L87 Difference]: Start difference. First operand 361 states and 360 transitions. Second operand has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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-18 19:37:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:56,678 INFO L93 Difference]: Finished difference Result 360 states and 359 transitions. [2022-11-18 19:37:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2022-11-18 19:37:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:56,681 INFO L225 Difference]: With dead ends: 360 [2022-11-18 19:37:56,681 INFO L226 Difference]: Without dead ends: 360 [2022-11-18 19:37:56,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:37:56,682 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 902 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:56,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 488 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:37:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-18 19:37:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2022-11-18 19:37:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 299 states have (on average 1.2006688963210703) internal successors, (359), 359 states have internal predecessors, (359), 0 states have call successors, (0), 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-18 19:37:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 359 transitions. [2022-11-18 19:37:56,691 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 359 transitions. Word has length 144 [2022-11-18 19:37:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:56,692 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 359 transitions. [2022-11-18 19:37:56,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 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-18 19:37:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 359 transitions. [2022-11-18 19:37:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-18 19:37:56,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:56,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-18 19:37:56,695 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:56,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 334816458, now seen corresponding path program 1 times [2022-11-18 19:37:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:56,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200923526] [2022-11-18 19:37:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:56,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:57,069 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-18 19:37:57,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:57,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200923526] [2022-11-18 19:37:57,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200923526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:57,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:57,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422331516] [2022-11-18 19:37:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:57,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:57,074 INFO L87 Difference]: Start difference. First operand 360 states and 359 transitions. Second operand has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:57,414 INFO L93 Difference]: Finished difference Result 359 states and 358 transitions. [2022-11-18 19:37:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-11-18 19:37:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:57,417 INFO L225 Difference]: With dead ends: 359 [2022-11-18 19:37:57,417 INFO L226 Difference]: Without dead ends: 359 [2022-11-18 19:37:57,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:57,418 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 421 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:57,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 363 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-18 19:37:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2022-11-18 19:37:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 358 states have internal predecessors, (358), 0 states have call successors, (0), 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-18 19:37:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 358 transitions. [2022-11-18 19:37:57,428 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 358 transitions. Word has length 149 [2022-11-18 19:37:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:57,429 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 358 transitions. [2022-11-18 19:37:57,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 358 transitions. [2022-11-18 19:37:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-18 19:37:57,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:57,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:57,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-18 19:37:57,432 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 334816459, now seen corresponding path program 1 times [2022-11-18 19:37:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:57,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424115328] [2022-11-18 19:37:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:58,307 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-18 19:37:58,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:58,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424115328] [2022-11-18 19:37:58,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424115328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:58,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:58,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:37:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994374551] [2022-11-18 19:37:58,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:58,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:37:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:58,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:37:58,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:37:58,311 INFO L87 Difference]: Start difference. First operand 359 states and 358 transitions. Second operand has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:59,065 INFO L93 Difference]: Finished difference Result 358 states and 357 transitions. [2022-11-18 19:37:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:37:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-11-18 19:37:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:59,068 INFO L225 Difference]: With dead ends: 358 [2022-11-18 19:37:59,068 INFO L226 Difference]: Without dead ends: 358 [2022-11-18 19:37:59,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:37:59,069 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 837 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:59,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 449 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:37:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-11-18 19:37:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2022-11-18 19:37:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 299 states have (on average 1.193979933110368) internal successors, (357), 357 states have internal predecessors, (357), 0 states have call successors, (0), 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-18 19:37:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 357 transitions. [2022-11-18 19:37:59,079 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 357 transitions. Word has length 149 [2022-11-18 19:37:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:59,079 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 357 transitions. [2022-11-18 19:37:59,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 357 transitions. [2022-11-18 19:37:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-18 19:37:59,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:59,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:59,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-18 19:37:59,082 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259036, now seen corresponding path program 1 times [2022-11-18 19:37:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:59,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346787638] [2022-11-18 19:37:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:37:59,426 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-18 19:37:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:37:59,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346787638] [2022-11-18 19:37:59,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346787638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:37:59,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:37:59,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:37:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81485012] [2022-11-18 19:37:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:37:59,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:37:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:37:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:37:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:37:59,429 INFO L87 Difference]: Start difference. First operand 358 states and 357 transitions. Second operand has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:37:59,742 INFO L93 Difference]: Finished difference Result 357 states and 356 transitions. [2022-11-18 19:37:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:37:59,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-11-18 19:37:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:37:59,745 INFO L225 Difference]: With dead ends: 357 [2022-11-18 19:37:59,745 INFO L226 Difference]: Without dead ends: 357 [2022-11-18 19:37:59,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:37:59,746 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 407 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:37:59,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 365 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:37:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-18 19:37:59,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-11-18 19:37:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 299 states have (on average 1.1906354515050168) internal successors, (356), 356 states have internal predecessors, (356), 0 states have call successors, (0), 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-18 19:37:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 356 transitions. [2022-11-18 19:37:59,755 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 356 transitions. Word has length 154 [2022-11-18 19:37:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:37:59,755 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 356 transitions. [2022-11-18 19:37:59,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:37:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 356 transitions. [2022-11-18 19:37:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-18 19:37:59,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:37:59,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:37:59,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-18 19:37:59,757 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:37:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:37:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259035, now seen corresponding path program 1 times [2022-11-18 19:37:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:37:59,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894580888] [2022-11-18 19:37:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:37:59,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:37:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:00,572 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-18 19:38:00,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:00,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894580888] [2022-11-18 19:38:00,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894580888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:00,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:00,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:00,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084095304] [2022-11-18 19:38:00,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:00,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:00,577 INFO L87 Difference]: Start difference. First operand 357 states and 356 transitions. Second operand has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:01,360 INFO L93 Difference]: Finished difference Result 356 states and 355 transitions. [2022-11-18 19:38:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:01,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2022-11-18 19:38:01,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:01,363 INFO L225 Difference]: With dead ends: 356 [2022-11-18 19:38:01,363 INFO L226 Difference]: Without dead ends: 356 [2022-11-18 19:38:01,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:01,364 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 607 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:01,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 492 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:38:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-11-18 19:38:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-11-18 19:38:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 299 states have (on average 1.1872909698996656) internal successors, (355), 355 states have internal predecessors, (355), 0 states have call successors, (0), 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-18 19:38:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 355 transitions. [2022-11-18 19:38:01,372 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 355 transitions. Word has length 154 [2022-11-18 19:38:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:01,372 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 355 transitions. [2022-11-18 19:38:01,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 355 transitions. [2022-11-18 19:38:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-18 19:38:01,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:01,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:01,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-18 19:38:01,374 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822629, now seen corresponding path program 1 times [2022-11-18 19:38:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:01,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730066682] [2022-11-18 19:38:01,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:01,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:01,699 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-18 19:38:01,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:01,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730066682] [2022-11-18 19:38:01,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730066682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:01,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:01,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:01,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756007181] [2022-11-18 19:38:01,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:01,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:01,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:01,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:01,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:01,702 INFO L87 Difference]: Start difference. First operand 356 states and 355 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:02,021 INFO L93 Difference]: Finished difference Result 355 states and 354 transitions. [2022-11-18 19:38:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-11-18 19:38:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:02,023 INFO L225 Difference]: With dead ends: 355 [2022-11-18 19:38:02,023 INFO L226 Difference]: Without dead ends: 355 [2022-11-18 19:38:02,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:02,024 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 393 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:02,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 367 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-18 19:38:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-11-18 19:38:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 299 states have (on average 1.1839464882943145) internal successors, (354), 354 states have internal predecessors, (354), 0 states have call successors, (0), 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-18 19:38:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 354 transitions. [2022-11-18 19:38:02,032 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 354 transitions. Word has length 159 [2022-11-18 19:38:02,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:02,032 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 354 transitions. [2022-11-18 19:38:02,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 354 transitions. [2022-11-18 19:38:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-18 19:38:02,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:02,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:02,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-18 19:38:02,035 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:02,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822628, now seen corresponding path program 1 times [2022-11-18 19:38:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455059825] [2022-11-18 19:38:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:02,878 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-18 19:38:02,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:02,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455059825] [2022-11-18 19:38:02,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455059825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:02,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:02,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757771667] [2022-11-18 19:38:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:02,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:02,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:02,888 INFO L87 Difference]: Start difference. First operand 355 states and 354 transitions. Second operand has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:03,636 INFO L93 Difference]: Finished difference Result 354 states and 353 transitions. [2022-11-18 19:38:03,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:03,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-11-18 19:38:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:03,639 INFO L225 Difference]: With dead ends: 354 [2022-11-18 19:38:03,639 INFO L226 Difference]: Without dead ends: 354 [2022-11-18 19:38:03,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:03,640 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 801 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:03,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 453 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-18 19:38:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-11-18 19:38:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 299 states have (on average 1.1806020066889633) internal successors, (353), 353 states have internal predecessors, (353), 0 states have call successors, (0), 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-18 19:38:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 353 transitions. [2022-11-18 19:38:03,647 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 353 transitions. Word has length 159 [2022-11-18 19:38:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:03,648 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 353 transitions. [2022-11-18 19:38:03,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 353 transitions. [2022-11-18 19:38:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-18 19:38:03,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:03,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:03,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-18 19:38:03,650 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash 117597077, now seen corresponding path program 1 times [2022-11-18 19:38:03,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:03,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26141994] [2022-11-18 19:38:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:03,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:03,984 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-18 19:38:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:03,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26141994] [2022-11-18 19:38:03,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26141994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:03,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:03,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656757190] [2022-11-18 19:38:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:03,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:03,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:03,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:03,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:03,987 INFO L87 Difference]: Start difference. First operand 354 states and 353 transitions. Second operand has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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-18 19:38:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:04,298 INFO L93 Difference]: Finished difference Result 353 states and 352 transitions. [2022-11-18 19:38:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:04,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-11-18 19:38:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:04,301 INFO L225 Difference]: With dead ends: 353 [2022-11-18 19:38:04,301 INFO L226 Difference]: Without dead ends: 353 [2022-11-18 19:38:04,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:04,301 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 379 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:04,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 369 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-18 19:38:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2022-11-18 19:38:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 299 states have (on average 1.1772575250836121) internal successors, (352), 352 states have internal predecessors, (352), 0 states have call successors, (0), 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-18 19:38:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 352 transitions. [2022-11-18 19:38:04,308 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 352 transitions. Word has length 164 [2022-11-18 19:38:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:04,309 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 352 transitions. [2022-11-18 19:38:04,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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-18 19:38:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 352 transitions. [2022-11-18 19:38:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-18 19:38:04,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:04,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:04,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-18 19:38:04,310 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 117597078, now seen corresponding path program 1 times [2022-11-18 19:38:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:04,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138872885] [2022-11-18 19:38:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:05,097 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-18 19:38:05,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:05,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138872885] [2022-11-18 19:38:05,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138872885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:05,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:05,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094521083] [2022-11-18 19:38:05,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:05,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:05,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:05,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:05,103 INFO L87 Difference]: Start difference. First operand 353 states and 352 transitions. Second operand has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 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-18 19:38:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:05,840 INFO L93 Difference]: Finished difference Result 352 states and 351 transitions. [2022-11-18 19:38:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-11-18 19:38:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:05,843 INFO L225 Difference]: With dead ends: 352 [2022-11-18 19:38:05,843 INFO L226 Difference]: Without dead ends: 352 [2022-11-18 19:38:05,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:05,844 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 775 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:05,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 455 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-18 19:38:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2022-11-18 19:38:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 299 states have (on average 1.173913043478261) internal successors, (351), 351 states have internal predecessors, (351), 0 states have call successors, (0), 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-18 19:38:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 351 transitions. [2022-11-18 19:38:05,852 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 351 transitions. Word has length 164 [2022-11-18 19:38:05,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:05,853 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 351 transitions. [2022-11-18 19:38:05,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 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-18 19:38:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 351 transitions. [2022-11-18 19:38:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 19:38:05,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:05,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:05,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-18 19:38:05,855 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash 264564972, now seen corresponding path program 1 times [2022-11-18 19:38:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:05,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263520367] [2022-11-18 19:38:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:06,227 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-18 19:38:06,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:06,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263520367] [2022-11-18 19:38:06,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263520367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:06,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:06,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810300966] [2022-11-18 19:38:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:06,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:06,232 INFO L87 Difference]: Start difference. First operand 352 states and 351 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:06,559 INFO L93 Difference]: Finished difference Result 351 states and 350 transitions. [2022-11-18 19:38:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:06,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-11-18 19:38:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:06,561 INFO L225 Difference]: With dead ends: 351 [2022-11-18 19:38:06,561 INFO L226 Difference]: Without dead ends: 351 [2022-11-18 19:38:06,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:06,562 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 365 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:06,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-18 19:38:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-11-18 19:38:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 299 states have (on average 1.1705685618729098) internal successors, (350), 350 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-18 19:38:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 350 transitions. [2022-11-18 19:38:06,592 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 350 transitions. Word has length 169 [2022-11-18 19:38:06,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:06,592 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 350 transitions. [2022-11-18 19:38:06,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 350 transitions. [2022-11-18 19:38:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 19:38:06,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:06,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-18 19:38:06,595 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 264564973, now seen corresponding path program 1 times [2022-11-18 19:38:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:06,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259673202] [2022-11-18 19:38:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:07,479 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-18 19:38:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:07,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259673202] [2022-11-18 19:38:07,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259673202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:07,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:07,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157559507] [2022-11-18 19:38:07,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:07,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:07,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:07,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:07,483 INFO L87 Difference]: Start difference. First operand 351 states and 350 transitions. Second operand has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:08,197 INFO L93 Difference]: Finished difference Result 350 states and 349 transitions. [2022-11-18 19:38:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:08,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-11-18 19:38:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:08,200 INFO L225 Difference]: With dead ends: 350 [2022-11-18 19:38:08,201 INFO L226 Difference]: Without dead ends: 350 [2022-11-18 19:38:08,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:08,202 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 574 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:08,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 498 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-18 19:38:08,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2022-11-18 19:38:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 349 states have internal predecessors, (349), 0 states have call successors, (0), 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-18 19:38:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 349 transitions. [2022-11-18 19:38:08,210 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 349 transitions. Word has length 169 [2022-11-18 19:38:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:08,210 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 349 transitions. [2022-11-18 19:38:08,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 349 transitions. [2022-11-18 19:38:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-18 19:38:08,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:08,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:08,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-18 19:38:08,213 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368902, now seen corresponding path program 1 times [2022-11-18 19:38:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:08,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123802550] [2022-11-18 19:38:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:08,579 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-18 19:38:08,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:08,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123802550] [2022-11-18 19:38:08,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123802550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:08,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:08,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:08,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681760902] [2022-11-18 19:38:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:08,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:08,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:08,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:08,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:08,582 INFO L87 Difference]: Start difference. First operand 350 states and 349 transitions. Second operand has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:08,885 INFO L93 Difference]: Finished difference Result 349 states and 348 transitions. [2022-11-18 19:38:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:08,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-11-18 19:38:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:08,887 INFO L225 Difference]: With dead ends: 349 [2022-11-18 19:38:08,887 INFO L226 Difference]: Without dead ends: 349 [2022-11-18 19:38:08,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:08,888 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 351 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:08,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 373 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:08,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-18 19:38:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-11-18 19:38:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 299 states have (on average 1.1638795986622072) internal successors, (348), 348 states have internal predecessors, (348), 0 states have call successors, (0), 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-18 19:38:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 348 transitions. [2022-11-18 19:38:08,896 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 348 transitions. Word has length 174 [2022-11-18 19:38:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:08,896 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 348 transitions. [2022-11-18 19:38:08,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 348 transitions. [2022-11-18 19:38:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-18 19:38:08,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:08,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:08,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-18 19:38:08,899 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:08,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:08,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368903, now seen corresponding path program 1 times [2022-11-18 19:38:08,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:08,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167811816] [2022-11-18 19:38:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:09,734 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-18 19:38:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:09,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167811816] [2022-11-18 19:38:09,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167811816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:09,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:09,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871675864] [2022-11-18 19:38:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:09,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:09,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:09,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:09,737 INFO L87 Difference]: Start difference. First operand 349 states and 348 transitions. Second operand has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:10,463 INFO L93 Difference]: Finished difference Result 348 states and 347 transitions. [2022-11-18 19:38:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2022-11-18 19:38:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:10,466 INFO L225 Difference]: With dead ends: 348 [2022-11-18 19:38:10,466 INFO L226 Difference]: Without dead ends: 348 [2022-11-18 19:38:10,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:10,467 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 739 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:10,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 459 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-18 19:38:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2022-11-18 19:38:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 299 states have (on average 1.160535117056856) internal successors, (347), 347 states have internal predecessors, (347), 0 states have call successors, (0), 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-18 19:38:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 347 transitions. [2022-11-18 19:38:10,475 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 347 transitions. Word has length 174 [2022-11-18 19:38:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:10,475 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 347 transitions. [2022-11-18 19:38:10,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 347 transitions. [2022-11-18 19:38:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-18 19:38:10,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:10,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:10,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-18 19:38:10,478 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash 135427325, now seen corresponding path program 1 times [2022-11-18 19:38:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:10,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150457595] [2022-11-18 19:38:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:10,761 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-18 19:38:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150457595] [2022-11-18 19:38:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150457595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:10,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:10,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:10,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217811831] [2022-11-18 19:38:10,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:10,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:10,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:10,765 INFO L87 Difference]: Start difference. First operand 348 states and 347 transitions. Second operand has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:11,057 INFO L93 Difference]: Finished difference Result 347 states and 346 transitions. [2022-11-18 19:38:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-11-18 19:38:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:11,059 INFO L225 Difference]: With dead ends: 347 [2022-11-18 19:38:11,059 INFO L226 Difference]: Without dead ends: 347 [2022-11-18 19:38:11,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:11,060 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 337 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:11,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 375 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-18 19:38:11,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2022-11-18 19:38:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 299 states have (on average 1.157190635451505) internal successors, (346), 346 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-18 19:38:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 346 transitions. [2022-11-18 19:38:11,073 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 346 transitions. Word has length 179 [2022-11-18 19:38:11,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:11,073 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 346 transitions. [2022-11-18 19:38:11,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 346 transitions. [2022-11-18 19:38:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-18 19:38:11,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:11,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:11,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-18 19:38:11,075 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 135427326, now seen corresponding path program 1 times [2022-11-18 19:38:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:11,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394157320] [2022-11-18 19:38:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:11,881 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-18 19:38:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:11,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394157320] [2022-11-18 19:38:11,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394157320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:11,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:11,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001796715] [2022-11-18 19:38:11,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:11,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:11,884 INFO L87 Difference]: Start difference. First operand 347 states and 346 transitions. Second operand has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:12,599 INFO L93 Difference]: Finished difference Result 346 states and 345 transitions. [2022-11-18 19:38:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:12,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2022-11-18 19:38:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:12,601 INFO L225 Difference]: With dead ends: 346 [2022-11-18 19:38:12,601 INFO L226 Difference]: Without dead ends: 346 [2022-11-18 19:38:12,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:12,601 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 552 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:12,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 502 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-11-18 19:38:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-11-18 19:38:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 299 states have (on average 1.1538461538461537) internal successors, (345), 345 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-18 19:38:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 345 transitions. [2022-11-18 19:38:12,609 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 345 transitions. Word has length 179 [2022-11-18 19:38:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:12,610 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 345 transitions. [2022-11-18 19:38:12,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:12,610 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 345 transitions. [2022-11-18 19:38:12,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-18 19:38:12,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:12,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:12,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-18 19:38:12,612 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash -277470217, now seen corresponding path program 1 times [2022-11-18 19:38:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:12,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132338536] [2022-11-18 19:38:12,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:12,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:12,963 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-18 19:38:12,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:12,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132338536] [2022-11-18 19:38:12,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132338536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:12,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:12,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:12,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71479968] [2022-11-18 19:38:12,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:12,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:12,966 INFO L87 Difference]: Start difference. First operand 346 states and 345 transitions. Second operand has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-18 19:38:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:13,272 INFO L93 Difference]: Finished difference Result 345 states and 344 transitions. [2022-11-18 19:38:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:13,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2022-11-18 19:38:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:13,274 INFO L225 Difference]: With dead ends: 345 [2022-11-18 19:38:13,275 INFO L226 Difference]: Without dead ends: 345 [2022-11-18 19:38:13,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:13,276 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 323 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:13,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 377 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-18 19:38:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2022-11-18 19:38:13,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 299 states have (on average 1.1505016722408026) internal successors, (344), 344 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-18 19:38:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 344 transitions. [2022-11-18 19:38:13,288 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 344 transitions. Word has length 184 [2022-11-18 19:38:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:13,288 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 344 transitions. [2022-11-18 19:38:13,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-18 19:38:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 344 transitions. [2022-11-18 19:38:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-18 19:38:13,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:13,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:13,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-18 19:38:13,290 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash -277470216, now seen corresponding path program 1 times [2022-11-18 19:38:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:13,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304738932] [2022-11-18 19:38:13,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:13,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:14,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-18 19:38:14,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:14,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304738932] [2022-11-18 19:38:14,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304738932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:14,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:14,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587195639] [2022-11-18 19:38:14,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:14,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:14,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:14,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:14,156 INFO L87 Difference]: Start difference. First operand 345 states and 344 transitions. Second operand has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 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-18 19:38:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:14,920 INFO L93 Difference]: Finished difference Result 344 states and 343 transitions. [2022-11-18 19:38:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2022-11-18 19:38:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:14,922 INFO L225 Difference]: With dead ends: 344 [2022-11-18 19:38:14,922 INFO L226 Difference]: Without dead ends: 344 [2022-11-18 19:38:14,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:14,923 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 541 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:14,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 504 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-18 19:38:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-11-18 19:38:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 299 states have (on average 1.1471571906354514) internal successors, (343), 343 states have internal predecessors, (343), 0 states have call successors, (0), 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-18 19:38:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 343 transitions. [2022-11-18 19:38:14,930 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 343 transitions. Word has length 184 [2022-11-18 19:38:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:14,931 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 343 transitions. [2022-11-18 19:38:14,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 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-18 19:38:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 343 transitions. [2022-11-18 19:38:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-18 19:38:14,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:14,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:14,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-18 19:38:14,934 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:14,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash -993899250, now seen corresponding path program 1 times [2022-11-18 19:38:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:14,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153582425] [2022-11-18 19:38:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:15,278 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-18 19:38:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:15,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153582425] [2022-11-18 19:38:15,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153582425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:15,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:15,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:15,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966759315] [2022-11-18 19:38:15,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:15,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:15,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:15,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:15,281 INFO L87 Difference]: Start difference. First operand 344 states and 343 transitions. Second operand has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 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-18 19:38:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:15,586 INFO L93 Difference]: Finished difference Result 343 states and 342 transitions. [2022-11-18 19:38:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:15,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-11-18 19:38:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:15,589 INFO L225 Difference]: With dead ends: 343 [2022-11-18 19:38:15,589 INFO L226 Difference]: Without dead ends: 343 [2022-11-18 19:38:15,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:15,590 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 309 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:15,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 379 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-18 19:38:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-11-18 19:38:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 299 states have (on average 1.1438127090301002) internal successors, (342), 342 states have internal predecessors, (342), 0 states have call successors, (0), 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-18 19:38:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 342 transitions. [2022-11-18 19:38:15,598 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 342 transitions. Word has length 189 [2022-11-18 19:38:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:15,598 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 342 transitions. [2022-11-18 19:38:15,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 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-18 19:38:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 342 transitions. [2022-11-18 19:38:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-18 19:38:15,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:15,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:15,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-18 19:38:15,601 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -993899249, now seen corresponding path program 1 times [2022-11-18 19:38:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:15,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813282239] [2022-11-18 19:38:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:16,695 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-18 19:38:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:16,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813282239] [2022-11-18 19:38:16,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813282239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:16,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:16,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011454426] [2022-11-18 19:38:16,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:16,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:16,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:16,698 INFO L87 Difference]: Start difference. First operand 343 states and 342 transitions. Second operand has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 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-18 19:38:17,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:17,469 INFO L93 Difference]: Finished difference Result 342 states and 341 transitions. [2022-11-18 19:38:17,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:17,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-11-18 19:38:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:17,472 INFO L225 Difference]: With dead ends: 342 [2022-11-18 19:38:17,472 INFO L226 Difference]: Without dead ends: 342 [2022-11-18 19:38:17,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:17,473 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 537 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:17,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 547 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-18 19:38:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-11-18 19:38:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.140468227424749) internal successors, (341), 341 states have internal predecessors, (341), 0 states have call successors, (0), 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-18 19:38:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 341 transitions. [2022-11-18 19:38:17,480 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 341 transitions. Word has length 189 [2022-11-18 19:38:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:17,481 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 341 transitions. [2022-11-18 19:38:17,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 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-18 19:38:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 341 transitions. [2022-11-18 19:38:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-18 19:38:17,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:17,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:17,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-18 19:38:17,484 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751720, now seen corresponding path program 1 times [2022-11-18 19:38:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:17,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750393169] [2022-11-18 19:38:17,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:17,853 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-18 19:38:17,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:17,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750393169] [2022-11-18 19:38:17,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750393169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:17,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:17,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:17,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253886658] [2022-11-18 19:38:17,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:17,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:17,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:17,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:17,856 INFO L87 Difference]: Start difference. First operand 342 states and 341 transitions. Second operand has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:18,151 INFO L93 Difference]: Finished difference Result 341 states and 340 transitions. [2022-11-18 19:38:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2022-11-18 19:38:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:18,153 INFO L225 Difference]: With dead ends: 341 [2022-11-18 19:38:18,154 INFO L226 Difference]: Without dead ends: 341 [2022-11-18 19:38:18,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:18,155 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 295 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:18,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 381 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-18 19:38:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-11-18 19:38:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 299 states have (on average 1.137123745819398) internal successors, (340), 340 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-18 19:38:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 340 transitions. [2022-11-18 19:38:18,163 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 340 transitions. Word has length 194 [2022-11-18 19:38:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:18,163 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 340 transitions. [2022-11-18 19:38:18,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 340 transitions. [2022-11-18 19:38:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-18 19:38:18,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:18,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:18,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-18 19:38:18,166 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751721, now seen corresponding path program 1 times [2022-11-18 19:38:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:18,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925889650] [2022-11-18 19:38:18,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:18,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:18,957 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-18 19:38:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:18,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925889650] [2022-11-18 19:38:18,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925889650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:18,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:18,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:18,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723576889] [2022-11-18 19:38:18,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:18,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:18,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:18,960 INFO L87 Difference]: Start difference. First operand 341 states and 340 transitions. Second operand has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:19,691 INFO L93 Difference]: Finished difference Result 340 states and 339 transitions. [2022-11-18 19:38:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2022-11-18 19:38:19,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:19,692 INFO L225 Difference]: With dead ends: 340 [2022-11-18 19:38:19,693 INFO L226 Difference]: Without dead ends: 340 [2022-11-18 19:38:19,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:19,693 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 772 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:19,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 508 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-18 19:38:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-11-18 19:38:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 299 states have (on average 1.1337792642140467) internal successors, (339), 339 states have internal predecessors, (339), 0 states have call successors, (0), 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-18 19:38:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 339 transitions. [2022-11-18 19:38:19,700 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 339 transitions. Word has length 194 [2022-11-18 19:38:19,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:19,701 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 339 transitions. [2022-11-18 19:38:19,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 339 transitions. [2022-11-18 19:38:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-18 19:38:19,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:19,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:19,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-18 19:38:19,703 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592929, now seen corresponding path program 1 times [2022-11-18 19:38:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:19,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503380961] [2022-11-18 19:38:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:20,030 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-18 19:38:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:20,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503380961] [2022-11-18 19:38:20,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503380961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:20,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:20,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042253169] [2022-11-18 19:38:20,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:20,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:20,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:20,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:20,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:20,033 INFO L87 Difference]: Start difference. First operand 340 states and 339 transitions. Second operand has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:20,323 INFO L93 Difference]: Finished difference Result 339 states and 338 transitions. [2022-11-18 19:38:20,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-11-18 19:38:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:20,329 INFO L225 Difference]: With dead ends: 339 [2022-11-18 19:38:20,329 INFO L226 Difference]: Without dead ends: 339 [2022-11-18 19:38:20,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:20,330 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 281 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:20,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 383 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-18 19:38:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-11-18 19:38:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 299 states have (on average 1.1304347826086956) internal successors, (338), 338 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-18 19:38:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 338 transitions. [2022-11-18 19:38:20,337 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 338 transitions. Word has length 199 [2022-11-18 19:38:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:20,338 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 338 transitions. [2022-11-18 19:38:20,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 338 transitions. [2022-11-18 19:38:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-18 19:38:20,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:20,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:20,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-18 19:38:20,340 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592928, now seen corresponding path program 1 times [2022-11-18 19:38:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:20,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813542157] [2022-11-18 19:38:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:21,254 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-18 19:38:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:21,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813542157] [2022-11-18 19:38:21,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813542157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:21,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:21,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786381378] [2022-11-18 19:38:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:21,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:21,257 INFO L87 Difference]: Start difference. First operand 339 states and 338 transitions. Second operand has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:21,997 INFO L93 Difference]: Finished difference Result 338 states and 337 transitions. [2022-11-18 19:38:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-11-18 19:38:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:21,998 INFO L225 Difference]: With dead ends: 338 [2022-11-18 19:38:21,998 INFO L226 Difference]: Without dead ends: 338 [2022-11-18 19:38:21,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:22,000 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 759 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:22,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 510 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:22,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-18 19:38:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-11-18 19:38:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 299 states have (on average 1.1270903010033444) internal successors, (337), 337 states have internal predecessors, (337), 0 states have call successors, (0), 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-18 19:38:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 337 transitions. [2022-11-18 19:38:22,008 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 337 transitions. Word has length 199 [2022-11-18 19:38:22,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:22,009 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 337 transitions. [2022-11-18 19:38:22,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 337 transitions. [2022-11-18 19:38:22,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-11-18 19:38:22,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:22,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:22,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-18 19:38:22,012 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:22,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:22,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430246, now seen corresponding path program 1 times [2022-11-18 19:38:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:22,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438865910] [2022-11-18 19:38:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:22,771 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-18 19:38:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438865910] [2022-11-18 19:38:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438865910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:22,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:22,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:22,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261596934] [2022-11-18 19:38:22,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:22,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:22,774 INFO L87 Difference]: Start difference. First operand 338 states and 337 transitions. Second operand has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 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-18 19:38:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:23,483 INFO L93 Difference]: Finished difference Result 337 states and 336 transitions. [2022-11-18 19:38:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:23,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2022-11-18 19:38:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:23,484 INFO L225 Difference]: With dead ends: 337 [2022-11-18 19:38:23,484 INFO L226 Difference]: Without dead ends: 337 [2022-11-18 19:38:23,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:23,485 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 750 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:23,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 512 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-18 19:38:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2022-11-18 19:38:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 299 states have (on average 1.1237458193979932) internal successors, (336), 336 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 336 transitions. [2022-11-18 19:38:23,493 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 336 transitions. Word has length 204 [2022-11-18 19:38:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:23,494 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 336 transitions. [2022-11-18 19:38:23,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 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-18 19:38:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 336 transitions. [2022-11-18 19:38:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-11-18 19:38:23,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:23,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:23,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-18 19:38:23,497 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430247, now seen corresponding path program 1 times [2022-11-18 19:38:23,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:23,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702464645] [2022-11-18 19:38:23,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:23,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:23,756 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-18 19:38:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702464645] [2022-11-18 19:38:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702464645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:23,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:23,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617017085] [2022-11-18 19:38:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:23,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:23,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:23,759 INFO L87 Difference]: Start difference. First operand 337 states and 336 transitions. Second operand has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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-18 19:38:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:24,039 INFO L93 Difference]: Finished difference Result 336 states and 335 transitions. [2022-11-18 19:38:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:24,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2022-11-18 19:38:24,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:24,042 INFO L225 Difference]: With dead ends: 336 [2022-11-18 19:38:24,042 INFO L226 Difference]: Without dead ends: 336 [2022-11-18 19:38:24,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:24,043 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 265 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:24,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 385 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-11-18 19:38:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2022-11-18 19:38:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 299 states have (on average 1.120401337792642) internal successors, (335), 335 states have internal predecessors, (335), 0 states have call successors, (0), 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-18 19:38:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 335 transitions. [2022-11-18 19:38:24,050 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 335 transitions. Word has length 204 [2022-11-18 19:38:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:24,050 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 335 transitions. [2022-11-18 19:38:24,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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-18 19:38:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 335 transitions. [2022-11-18 19:38:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-18 19:38:24,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:24,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:24,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-18 19:38:24,053 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749136, now seen corresponding path program 1 times [2022-11-18 19:38:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:24,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138482948] [2022-11-18 19:38:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:24,384 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-18 19:38:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:24,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138482948] [2022-11-18 19:38:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138482948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:24,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:24,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781085547] [2022-11-18 19:38:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:24,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:24,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:24,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:24,387 INFO L87 Difference]: Start difference. First operand 336 states and 335 transitions. Second operand has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 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-18 19:38:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:24,663 INFO L93 Difference]: Finished difference Result 335 states and 334 transitions. [2022-11-18 19:38:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:24,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2022-11-18 19:38:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:24,666 INFO L225 Difference]: With dead ends: 335 [2022-11-18 19:38:24,666 INFO L226 Difference]: Without dead ends: 335 [2022-11-18 19:38:24,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:24,667 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 253 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:24,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 387 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-18 19:38:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2022-11-18 19:38:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 299 states have (on average 1.117056856187291) internal successors, (334), 334 states have internal predecessors, (334), 0 states have call successors, (0), 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-18 19:38:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 334 transitions. [2022-11-18 19:38:24,674 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 334 transitions. Word has length 209 [2022-11-18 19:38:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:24,674 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 334 transitions. [2022-11-18 19:38:24,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 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-18 19:38:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 334 transitions. [2022-11-18 19:38:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-18 19:38:24,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:24,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:24,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-18 19:38:24,677 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:24,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749135, now seen corresponding path program 1 times [2022-11-18 19:38:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:24,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453807655] [2022-11-18 19:38:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:25,593 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-18 19:38:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:25,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453807655] [2022-11-18 19:38:25,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453807655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:25,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:25,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:25,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110009534] [2022-11-18 19:38:25,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:25,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:25,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:25,595 INFO L87 Difference]: Start difference. First operand 335 states and 334 transitions. Second operand has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 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-18 19:38:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:26,254 INFO L93 Difference]: Finished difference Result 334 states and 333 transitions. [2022-11-18 19:38:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2022-11-18 19:38:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:26,257 INFO L225 Difference]: With dead ends: 334 [2022-11-18 19:38:26,257 INFO L226 Difference]: Without dead ends: 334 [2022-11-18 19:38:26,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:26,258 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 613 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:26,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 473 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:38:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-18 19:38:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-11-18 19:38:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 1.1137123745819397) internal successors, (333), 333 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 333 transitions. [2022-11-18 19:38:26,265 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 333 transitions. Word has length 209 [2022-11-18 19:38:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:26,266 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 333 transitions. [2022-11-18 19:38:26,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 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-18 19:38:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 333 transitions. [2022-11-18 19:38:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-18 19:38:26,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:26,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:26,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-18 19:38:26,268 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476918, now seen corresponding path program 1 times [2022-11-18 19:38:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:26,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788497021] [2022-11-18 19:38:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:26,667 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-18 19:38:26,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:26,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788497021] [2022-11-18 19:38:26,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788497021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:26,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:26,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505099382] [2022-11-18 19:38:26,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:26,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:26,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:26,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:26,671 INFO L87 Difference]: Start difference. First operand 334 states and 333 transitions. Second operand has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:26,968 INFO L93 Difference]: Finished difference Result 333 states and 332 transitions. [2022-11-18 19:38:26,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:26,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2022-11-18 19:38:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:26,971 INFO L225 Difference]: With dead ends: 333 [2022-11-18 19:38:26,972 INFO L226 Difference]: Without dead ends: 333 [2022-11-18 19:38:26,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:26,972 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 239 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:26,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 389 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-18 19:38:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-11-18 19:38:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 299 states have (on average 1.1103678929765886) internal successors, (332), 332 states have internal predecessors, (332), 0 states have call successors, (0), 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-18 19:38:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 332 transitions. [2022-11-18 19:38:26,979 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 332 transitions. Word has length 214 [2022-11-18 19:38:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:26,980 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 332 transitions. [2022-11-18 19:38:26,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 332 transitions. [2022-11-18 19:38:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-18 19:38:26,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:26,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:26,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-18 19:38:26,982 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:26,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:26,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476917, now seen corresponding path program 1 times [2022-11-18 19:38:26,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:26,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109138394] [2022-11-18 19:38:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:27,914 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-18 19:38:27,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:27,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109138394] [2022-11-18 19:38:27,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109138394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:27,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:27,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:27,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213052057] [2022-11-18 19:38:27,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:27,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:27,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:27,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:27,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:27,917 INFO L87 Difference]: Start difference. First operand 333 states and 332 transitions. Second operand has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:28,618 INFO L93 Difference]: Finished difference Result 332 states and 331 transitions. [2022-11-18 19:38:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:28,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2022-11-18 19:38:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:28,621 INFO L225 Difference]: With dead ends: 332 [2022-11-18 19:38:28,621 INFO L226 Difference]: Without dead ends: 332 [2022-11-18 19:38:28,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:28,622 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 595 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:28,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 475 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-18 19:38:28,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-11-18 19:38:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 299 states have (on average 1.1070234113712374) internal successors, (331), 331 states have internal predecessors, (331), 0 states have call successors, (0), 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-18 19:38:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 331 transitions. [2022-11-18 19:38:28,629 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 331 transitions. Word has length 214 [2022-11-18 19:38:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:28,630 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 331 transitions. [2022-11-18 19:38:28,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 331 transitions. [2022-11-18 19:38:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-18 19:38:28,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:28,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:28,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-18 19:38:28,632 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:28,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118593, now seen corresponding path program 1 times [2022-11-18 19:38:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:28,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110909675] [2022-11-18 19:38:28,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:29,017 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-18 19:38:29,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:29,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110909675] [2022-11-18 19:38:29,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110909675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:29,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:29,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:29,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786517266] [2022-11-18 19:38:29,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:29,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:29,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:29,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:29,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:29,022 INFO L87 Difference]: Start difference. First operand 332 states and 331 transitions. Second operand has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:29,323 INFO L93 Difference]: Finished difference Result 331 states and 330 transitions. [2022-11-18 19:38:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2022-11-18 19:38:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:29,325 INFO L225 Difference]: With dead ends: 331 [2022-11-18 19:38:29,325 INFO L226 Difference]: Without dead ends: 331 [2022-11-18 19:38:29,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:29,326 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 225 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:29,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 391 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-18 19:38:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2022-11-18 19:38:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.1036789297658862) internal successors, (330), 330 states have internal predecessors, (330), 0 states have call successors, (0), 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-18 19:38:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 330 transitions. [2022-11-18 19:38:29,332 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 330 transitions. Word has length 219 [2022-11-18 19:38:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:29,332 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 330 transitions. [2022-11-18 19:38:29,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 330 transitions. [2022-11-18 19:38:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-18 19:38:29,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:29,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:29,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-18 19:38:29,334 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118594, now seen corresponding path program 1 times [2022-11-18 19:38:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841081397] [2022-11-18 19:38:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:30,158 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-18 19:38:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:30,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841081397] [2022-11-18 19:38:30,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841081397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:30,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:30,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019088834] [2022-11-18 19:38:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:30,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:30,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:30,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:30,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:30,161 INFO L87 Difference]: Start difference. First operand 331 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:30,828 INFO L93 Difference]: Finished difference Result 330 states and 329 transitions. [2022-11-18 19:38:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2022-11-18 19:38:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:30,831 INFO L225 Difference]: With dead ends: 330 [2022-11-18 19:38:30,831 INFO L226 Difference]: Without dead ends: 330 [2022-11-18 19:38:30,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:30,831 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 821 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:30,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 477 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:38:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-18 19:38:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2022-11-18 19:38:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 299 states have (on average 1.100334448160535) internal successors, (329), 329 states have internal predecessors, (329), 0 states have call successors, (0), 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-18 19:38:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 329 transitions. [2022-11-18 19:38:30,837 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 329 transitions. Word has length 219 [2022-11-18 19:38:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:30,838 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 329 transitions. [2022-11-18 19:38:30,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 329 transitions. [2022-11-18 19:38:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-11-18 19:38:30,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:30,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:30,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-18 19:38:30,841 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:30,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147845, now seen corresponding path program 1 times [2022-11-18 19:38:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:30,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424646910] [2022-11-18 19:38:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:31,117 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-18 19:38:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:31,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424646910] [2022-11-18 19:38:31,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424646910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:31,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:31,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863907102] [2022-11-18 19:38:31,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:31,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:31,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:31,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:31,119 INFO L87 Difference]: Start difference. First operand 330 states and 329 transitions. Second operand has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-18 19:38:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:31,389 INFO L93 Difference]: Finished difference Result 329 states and 328 transitions. [2022-11-18 19:38:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:31,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2022-11-18 19:38:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:31,391 INFO L225 Difference]: With dead ends: 329 [2022-11-18 19:38:31,391 INFO L226 Difference]: Without dead ends: 329 [2022-11-18 19:38:31,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:31,391 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 211 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:31,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 393 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-18 19:38:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-11-18 19:38:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 299 states have (on average 1.0969899665551839) internal successors, (328), 328 states have internal predecessors, (328), 0 states have call successors, (0), 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-18 19:38:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 328 transitions. [2022-11-18 19:38:31,398 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 328 transitions. Word has length 224 [2022-11-18 19:38:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:31,398 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 328 transitions. [2022-11-18 19:38:31,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-18 19:38:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 328 transitions. [2022-11-18 19:38:31,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-11-18 19:38:31,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:31,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:31,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-18 19:38:31,401 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:31,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147844, now seen corresponding path program 1 times [2022-11-18 19:38:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:31,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103642277] [2022-11-18 19:38:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:31,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:32,139 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-18 19:38:32,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:32,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103642277] [2022-11-18 19:38:32,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103642277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:32,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:32,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117992284] [2022-11-18 19:38:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:32,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:32,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:32,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:32,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:32,142 INFO L87 Difference]: Start difference. First operand 329 states and 328 transitions. Second operand has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 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-18 19:38:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:32,799 INFO L93 Difference]: Finished difference Result 328 states and 327 transitions. [2022-11-18 19:38:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2022-11-18 19:38:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:32,805 INFO L225 Difference]: With dead ends: 328 [2022-11-18 19:38:32,805 INFO L226 Difference]: Without dead ends: 328 [2022-11-18 19:38:32,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:32,806 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 559 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:32,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 479 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:38:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-18 19:38:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-11-18 19:38:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 299 states have (on average 1.0936454849498327) internal successors, (327), 327 states have internal predecessors, (327), 0 states have call successors, (0), 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-18 19:38:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 327 transitions. [2022-11-18 19:38:32,813 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 327 transitions. Word has length 224 [2022-11-18 19:38:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:32,814 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 327 transitions. [2022-11-18 19:38:32,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 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-18 19:38:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 327 transitions. [2022-11-18 19:38:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-18 19:38:32,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:32,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:32,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-18 19:38:32,816 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash -551226030, now seen corresponding path program 1 times [2022-11-18 19:38:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:32,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336865971] [2022-11-18 19:38:32,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:33,117 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-18 19:38:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336865971] [2022-11-18 19:38:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336865971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:33,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:33,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:33,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803811354] [2022-11-18 19:38:33,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:33,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:33,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:33,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:33,120 INFO L87 Difference]: Start difference. First operand 328 states and 327 transitions. Second operand has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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-18 19:38:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:33,390 INFO L93 Difference]: Finished difference Result 327 states and 326 transitions. [2022-11-18 19:38:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2022-11-18 19:38:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:33,392 INFO L225 Difference]: With dead ends: 327 [2022-11-18 19:38:33,392 INFO L226 Difference]: Without dead ends: 327 [2022-11-18 19:38:33,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:33,392 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 197 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:33,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 395 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-18 19:38:33,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-11-18 19:38:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 299 states have (on average 1.0903010033444815) internal successors, (326), 326 states have internal predecessors, (326), 0 states have call successors, (0), 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-18 19:38:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 326 transitions. [2022-11-18 19:38:33,398 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 326 transitions. Word has length 229 [2022-11-18 19:38:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:33,398 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 326 transitions. [2022-11-18 19:38:33,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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-18 19:38:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 326 transitions. [2022-11-18 19:38:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-18 19:38:33,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:33,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:33,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-18 19:38:33,401 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash -551226029, now seen corresponding path program 1 times [2022-11-18 19:38:33,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:33,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908690402] [2022-11-18 19:38:33,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:33,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:34,364 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-18 19:38:34,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:34,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908690402] [2022-11-18 19:38:34,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908690402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:34,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:34,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:34,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660890878] [2022-11-18 19:38:34,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:34,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:34,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:34,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:34,368 INFO L87 Difference]: Start difference. First operand 327 states and 326 transitions. Second operand has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 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-18 19:38:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:35,051 INFO L93 Difference]: Finished difference Result 326 states and 325 transitions. [2022-11-18 19:38:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:35,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2022-11-18 19:38:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:35,054 INFO L225 Difference]: With dead ends: 326 [2022-11-18 19:38:35,054 INFO L226 Difference]: Without dead ends: 326 [2022-11-18 19:38:35,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:35,055 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 442 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:35,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 522 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-18 19:38:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-11-18 19:38:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 299 states have (on average 1.0869565217391304) internal successors, (325), 325 states have internal predecessors, (325), 0 states have call successors, (0), 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-18 19:38:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 325 transitions. [2022-11-18 19:38:35,062 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 325 transitions. Word has length 229 [2022-11-18 19:38:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:35,063 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 325 transitions. [2022-11-18 19:38:35,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 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-18 19:38:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 325 transitions. [2022-11-18 19:38:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-18 19:38:35,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:35,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:35,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-18 19:38:35,065 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196692, now seen corresponding path program 1 times [2022-11-18 19:38:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:35,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648638213] [2022-11-18 19:38:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:35,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:35,348 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-18 19:38:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:35,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648638213] [2022-11-18 19:38:35,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648638213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:35,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:35,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:35,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115517342] [2022-11-18 19:38:35,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:35,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:35,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:35,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:35,351 INFO L87 Difference]: Start difference. First operand 326 states and 325 transitions. Second operand has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:35,622 INFO L93 Difference]: Finished difference Result 325 states and 324 transitions. [2022-11-18 19:38:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:35,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-11-18 19:38:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:35,623 INFO L225 Difference]: With dead ends: 325 [2022-11-18 19:38:35,623 INFO L226 Difference]: Without dead ends: 325 [2022-11-18 19:38:35,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:35,624 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 183 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:35,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 397 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-18 19:38:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-18 19:38:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 299 states have (on average 1.0836120401337792) internal successors, (324), 324 states have internal predecessors, (324), 0 states have call successors, (0), 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-18 19:38:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 324 transitions. [2022-11-18 19:38:35,628 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 324 transitions. Word has length 234 [2022-11-18 19:38:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:35,628 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 324 transitions. [2022-11-18 19:38:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 324 transitions. [2022-11-18 19:38:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-18 19:38:35,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:35,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:35,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-18 19:38:35,631 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196691, now seen corresponding path program 1 times [2022-11-18 19:38:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:35,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234823010] [2022-11-18 19:38:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:36,467 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-18 19:38:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234823010] [2022-11-18 19:38:36,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234823010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:36,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:36,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:36,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966091307] [2022-11-18 19:38:36,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:36,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:36,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:36,470 INFO L87 Difference]: Start difference. First operand 325 states and 324 transitions. Second operand has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:37,165 INFO L93 Difference]: Finished difference Result 324 states and 323 transitions. [2022-11-18 19:38:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-11-18 19:38:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:37,167 INFO L225 Difference]: With dead ends: 324 [2022-11-18 19:38:37,167 INFO L226 Difference]: Without dead ends: 324 [2022-11-18 19:38:37,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:37,168 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 431 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:37,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 524 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-18 19:38:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-11-18 19:38:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 299 states have (on average 1.080267558528428) internal successors, (323), 323 states have internal predecessors, (323), 0 states have call successors, (0), 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-18 19:38:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 323 transitions. [2022-11-18 19:38:37,171 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 323 transitions. Word has length 234 [2022-11-18 19:38:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:37,171 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 323 transitions. [2022-11-18 19:38:37,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 323 transitions. [2022-11-18 19:38:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-11-18 19:38:37,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:37,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:37,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-18 19:38:37,173 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:37,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash 755593571, now seen corresponding path program 1 times [2022-11-18 19:38:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:37,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905706931] [2022-11-18 19:38:37,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:37,474 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-18 19:38:37,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:37,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905706931] [2022-11-18 19:38:37,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905706931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:37,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:37,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:37,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640981829] [2022-11-18 19:38:37,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:37,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:37,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:37,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:37,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:37,477 INFO L87 Difference]: Start difference. First operand 324 states and 323 transitions. Second operand has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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-18 19:38:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:37,746 INFO L93 Difference]: Finished difference Result 323 states and 322 transitions. [2022-11-18 19:38:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:37,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2022-11-18 19:38:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:37,747 INFO L225 Difference]: With dead ends: 323 [2022-11-18 19:38:37,747 INFO L226 Difference]: Without dead ends: 323 [2022-11-18 19:38:37,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:37,748 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 169 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:37,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 399 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-18 19:38:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-18 19:38:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 299 states have (on average 1.0769230769230769) internal successors, (322), 322 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-18 19:38:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 322 transitions. [2022-11-18 19:38:37,755 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 322 transitions. Word has length 239 [2022-11-18 19:38:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:37,755 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 322 transitions. [2022-11-18 19:38:37,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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-18 19:38:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 322 transitions. [2022-11-18 19:38:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-11-18 19:38:37,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:37,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:37,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-18 19:38:37,758 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash 755593572, now seen corresponding path program 1 times [2022-11-18 19:38:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:37,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445473083] [2022-11-18 19:38:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:38,557 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-18 19:38:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:38,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445473083] [2022-11-18 19:38:38,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445473083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:38,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:38,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079656760] [2022-11-18 19:38:38,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:38,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:38,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:38,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:38,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:38,561 INFO L87 Difference]: Start difference. First operand 323 states and 322 transitions. Second operand has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 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-18 19:38:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:39,254 INFO L93 Difference]: Finished difference Result 322 states and 321 transitions. [2022-11-18 19:38:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2022-11-18 19:38:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:39,255 INFO L225 Difference]: With dead ends: 322 [2022-11-18 19:38:39,255 INFO L226 Difference]: Without dead ends: 322 [2022-11-18 19:38:39,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:39,256 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 655 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:39,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 526 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-18 19:38:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-18 19:38:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 299 states have (on average 1.0735785953177257) internal successors, (321), 321 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-18 19:38:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 321 transitions. [2022-11-18 19:38:39,262 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 321 transitions. Word has length 239 [2022-11-18 19:38:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:39,263 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 321 transitions. [2022-11-18 19:38:39,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 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-18 19:38:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 321 transitions. [2022-11-18 19:38:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-18 19:38:39,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:39,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:39,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-18 19:38:39,266 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:39,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:39,266 INFO L85 PathProgramCache]: Analyzing trace with hash 858096925, now seen corresponding path program 1 times [2022-11-18 19:38:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:39,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115177797] [2022-11-18 19:38:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:39,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:39,623 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-18 19:38:39,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:39,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115177797] [2022-11-18 19:38:39,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115177797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:39,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:39,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630067934] [2022-11-18 19:38:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:39,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:39,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:39,628 INFO L87 Difference]: Start difference. First operand 322 states and 321 transitions. Second operand has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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-18 19:38:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:39,903 INFO L93 Difference]: Finished difference Result 321 states and 320 transitions. [2022-11-18 19:38:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:39,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2022-11-18 19:38:39,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:39,904 INFO L225 Difference]: With dead ends: 321 [2022-11-18 19:38:39,904 INFO L226 Difference]: Without dead ends: 321 [2022-11-18 19:38:39,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:39,905 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 155 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:39,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 401 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-18 19:38:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-11-18 19:38:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 299 states have (on average 1.0702341137123745) internal successors, (320), 320 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-18 19:38:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 320 transitions. [2022-11-18 19:38:39,909 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 320 transitions. Word has length 244 [2022-11-18 19:38:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:39,909 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 320 transitions. [2022-11-18 19:38:39,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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-18 19:38:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 320 transitions. [2022-11-18 19:38:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-18 19:38:39,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:39,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:39,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-18 19:38:39,912 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:39,913 INFO L85 PathProgramCache]: Analyzing trace with hash 858096926, now seen corresponding path program 1 times [2022-11-18 19:38:39,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:39,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822191177] [2022-11-18 19:38:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:40,751 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-18 19:38:40,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822191177] [2022-11-18 19:38:40,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822191177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:40,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:40,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790369594] [2022-11-18 19:38:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:40,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:40,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:40,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:40,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:40,753 INFO L87 Difference]: Start difference. First operand 321 states and 320 transitions. Second operand has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 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-18 19:38:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:41,444 INFO L93 Difference]: Finished difference Result 320 states and 319 transitions. [2022-11-18 19:38:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2022-11-18 19:38:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:41,447 INFO L225 Difference]: With dead ends: 320 [2022-11-18 19:38:41,447 INFO L226 Difference]: Without dead ends: 320 [2022-11-18 19:38:41,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:41,447 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 642 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:41,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 528 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:41,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-18 19:38:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2022-11-18 19:38:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 299 states have (on average 1.0668896321070234) internal successors, (319), 319 states have internal predecessors, (319), 0 states have call successors, (0), 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-18 19:38:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 319 transitions. [2022-11-18 19:38:41,453 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 319 transitions. Word has length 244 [2022-11-18 19:38:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:41,454 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 319 transitions. [2022-11-18 19:38:41,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 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-18 19:38:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 319 transitions. [2022-11-18 19:38:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-11-18 19:38:41,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:41,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:41,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-18 19:38:41,457 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:41,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360308, now seen corresponding path program 1 times [2022-11-18 19:38:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:41,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514127059] [2022-11-18 19:38:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:41,781 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-18 19:38:41,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:41,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514127059] [2022-11-18 19:38:41,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514127059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:41,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:41,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636711453] [2022-11-18 19:38:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:41,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:41,784 INFO L87 Difference]: Start difference. First operand 320 states and 319 transitions. Second operand has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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-18 19:38:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:42,055 INFO L93 Difference]: Finished difference Result 319 states and 318 transitions. [2022-11-18 19:38:42,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2022-11-18 19:38:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:42,058 INFO L225 Difference]: With dead ends: 319 [2022-11-18 19:38:42,058 INFO L226 Difference]: Without dead ends: 319 [2022-11-18 19:38:42,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:42,058 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 141 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:42,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 403 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-18 19:38:42,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-11-18 19:38:42,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 299 states have (on average 1.0635451505016722) internal successors, (318), 318 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 318 transitions. [2022-11-18 19:38:42,064 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 318 transitions. Word has length 249 [2022-11-18 19:38:42,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:42,065 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 318 transitions. [2022-11-18 19:38:42,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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-18 19:38:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 318 transitions. [2022-11-18 19:38:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-11-18 19:38:42,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:42,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:42,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-18 19:38:42,067 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360309, now seen corresponding path program 1 times [2022-11-18 19:38:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:42,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639866338] [2022-11-18 19:38:42,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:42,937 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-18 19:38:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:42,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639866338] [2022-11-18 19:38:42,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639866338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:42,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:42,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:42,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095198428] [2022-11-18 19:38:42,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:42,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:42,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:42,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:42,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:42,939 INFO L87 Difference]: Start difference. First operand 319 states and 318 transitions. Second operand has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 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-18 19:38:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:43,645 INFO L93 Difference]: Finished difference Result 318 states and 317 transitions. [2022-11-18 19:38:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:43,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2022-11-18 19:38:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:43,648 INFO L225 Difference]: With dead ends: 318 [2022-11-18 19:38:43,648 INFO L226 Difference]: Without dead ends: 318 [2022-11-18 19:38:43,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:43,651 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 398 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:43,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 530 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-18 19:38:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-11-18 19:38:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 299 states have (on average 1.060200668896321) internal successors, (317), 317 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-18 19:38:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 317 transitions. [2022-11-18 19:38:43,657 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 317 transitions. Word has length 249 [2022-11-18 19:38:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:43,658 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 317 transitions. [2022-11-18 19:38:43,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 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-18 19:38:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 317 transitions. [2022-11-18 19:38:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-18 19:38:43,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:43,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:43,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-18 19:38:43,661 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash 472395598, now seen corresponding path program 1 times [2022-11-18 19:38:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:43,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718044613] [2022-11-18 19:38:43,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:43,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:44,006 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-18 19:38:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:44,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718044613] [2022-11-18 19:38:44,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718044613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:44,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:44,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779224475] [2022-11-18 19:38:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:44,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:44,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:44,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:44,010 INFO L87 Difference]: Start difference. First operand 318 states and 317 transitions. Second operand has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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-18 19:38:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:44,279 INFO L93 Difference]: Finished difference Result 317 states and 316 transitions. [2022-11-18 19:38:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-11-18 19:38:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:44,282 INFO L225 Difference]: With dead ends: 317 [2022-11-18 19:38:44,282 INFO L226 Difference]: Without dead ends: 317 [2022-11-18 19:38:44,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:44,282 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:44,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 405 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-18 19:38:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2022-11-18 19:38:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 299 states have (on average 1.0568561872909699) internal successors, (316), 316 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:38:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 316 transitions. [2022-11-18 19:38:44,287 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 316 transitions. Word has length 254 [2022-11-18 19:38:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:44,288 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 316 transitions. [2022-11-18 19:38:44,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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-18 19:38:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 316 transitions. [2022-11-18 19:38:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-18 19:38:44,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:44,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:44,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-11-18 19:38:44,291 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash 472395599, now seen corresponding path program 1 times [2022-11-18 19:38:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422779805] [2022-11-18 19:38:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:45,080 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-18 19:38:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:45,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422779805] [2022-11-18 19:38:45,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422779805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:45,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:45,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623705878] [2022-11-18 19:38:45,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:45,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:45,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:45,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:45,083 INFO L87 Difference]: Start difference. First operand 317 states and 316 transitions. Second operand has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 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-18 19:38:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:45,729 INFO L93 Difference]: Finished difference Result 316 states and 315 transitions. [2022-11-18 19:38:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:45,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-11-18 19:38:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:45,731 INFO L225 Difference]: With dead ends: 316 [2022-11-18 19:38:45,731 INFO L226 Difference]: Without dead ends: 316 [2022-11-18 19:38:45,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:45,732 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 451 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:45,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:38:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-18 19:38:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-11-18 19:38:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 299 states have (on average 1.0535117056856187) internal successors, (315), 315 states have internal predecessors, (315), 0 states have call successors, (0), 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-18 19:38:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 315 transitions. [2022-11-18 19:38:45,735 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 315 transitions. Word has length 254 [2022-11-18 19:38:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:45,735 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 315 transitions. [2022-11-18 19:38:45,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 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-18 19:38:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 315 transitions. [2022-11-18 19:38:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-18 19:38:45,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:45,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:45,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-11-18 19:38:45,738 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:45,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash 513697157, now seen corresponding path program 1 times [2022-11-18 19:38:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:45,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282940149] [2022-11-18 19:38:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:46,072 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-18 19:38:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:46,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282940149] [2022-11-18 19:38:46,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282940149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:46,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:46,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317228010] [2022-11-18 19:38:46,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:46,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:46,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:46,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:46,075 INFO L87 Difference]: Start difference. First operand 316 states and 315 transitions. Second operand has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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-18 19:38:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:46,360 INFO L93 Difference]: Finished difference Result 315 states and 314 transitions. [2022-11-18 19:38:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2022-11-18 19:38:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:46,363 INFO L225 Difference]: With dead ends: 315 [2022-11-18 19:38:46,363 INFO L226 Difference]: Without dead ends: 315 [2022-11-18 19:38:46,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:46,363 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 113 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:46,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 407 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-18 19:38:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-11-18 19:38:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 299 states have (on average 1.0501672240802675) internal successors, (314), 314 states have internal predecessors, (314), 0 states have call successors, (0), 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-18 19:38:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 314 transitions. [2022-11-18 19:38:46,366 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 314 transitions. Word has length 259 [2022-11-18 19:38:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:46,367 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 314 transitions. [2022-11-18 19:38:46,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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-18 19:38:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 314 transitions. [2022-11-18 19:38:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-18 19:38:46,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:46,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-18 19:38:46,373 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash 513697158, now seen corresponding path program 1 times [2022-11-18 19:38:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:46,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81793522] [2022-11-18 19:38:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:47,188 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-18 19:38:47,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:47,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81793522] [2022-11-18 19:38:47,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81793522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:47,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:47,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131349744] [2022-11-18 19:38:47,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:47,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:47,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:47,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:47,190 INFO L87 Difference]: Start difference. First operand 315 states and 314 transitions. Second operand has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 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-18 19:38:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:47,870 INFO L93 Difference]: Finished difference Result 314 states and 313 transitions. [2022-11-18 19:38:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:47,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2022-11-18 19:38:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:47,871 INFO L225 Difference]: With dead ends: 314 [2022-11-18 19:38:47,871 INFO L226 Difference]: Without dead ends: 314 [2022-11-18 19:38:47,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:47,872 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 384 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:47,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 534 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-18 19:38:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2022-11-18 19:38:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 299 states have (on average 1.0468227424749164) internal successors, (313), 313 states have internal predecessors, (313), 0 states have call successors, (0), 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-18 19:38:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 313 transitions. [2022-11-18 19:38:47,875 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 313 transitions. Word has length 259 [2022-11-18 19:38:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:47,875 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 313 transitions. [2022-11-18 19:38:47,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 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-18 19:38:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 313 transitions. [2022-11-18 19:38:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-18 19:38:47,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:47,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:47,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-18 19:38:47,878 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325825, now seen corresponding path program 1 times [2022-11-18 19:38:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:47,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134647759] [2022-11-18 19:38:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:48,208 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-18 19:38:48,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:48,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134647759] [2022-11-18 19:38:48,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134647759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:48,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:48,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:48,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546670221] [2022-11-18 19:38:48,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:48,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:48,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:48,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:48,211 INFO L87 Difference]: Start difference. First operand 314 states and 313 transitions. Second operand has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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-18 19:38:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:48,476 INFO L93 Difference]: Finished difference Result 313 states and 312 transitions. [2022-11-18 19:38:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-11-18 19:38:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:48,478 INFO L225 Difference]: With dead ends: 313 [2022-11-18 19:38:48,479 INFO L226 Difference]: Without dead ends: 313 [2022-11-18 19:38:48,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:48,479 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 99 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:48,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 409 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-18 19:38:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-11-18 19:38:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 299 states have (on average 1.0434782608695652) internal successors, (312), 312 states have internal predecessors, (312), 0 states have call successors, (0), 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-18 19:38:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 312 transitions. [2022-11-18 19:38:48,486 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 312 transitions. Word has length 264 [2022-11-18 19:38:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:48,486 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 312 transitions. [2022-11-18 19:38:48,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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-18 19:38:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 312 transitions. [2022-11-18 19:38:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-18 19:38:48,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:48,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:48,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-11-18 19:38:48,489 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325824, now seen corresponding path program 1 times [2022-11-18 19:38:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:48,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224110264] [2022-11-18 19:38:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:49,335 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-18 19:38:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:49,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224110264] [2022-11-18 19:38:49,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224110264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:49,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:49,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848046651] [2022-11-18 19:38:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:49,337 INFO L87 Difference]: Start difference. First operand 313 states and 312 transitions. Second operand has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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-18 19:38:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:50,005 INFO L93 Difference]: Finished difference Result 312 states and 311 transitions. [2022-11-18 19:38:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-11-18 19:38:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:50,007 INFO L225 Difference]: With dead ends: 312 [2022-11-18 19:38:50,007 INFO L226 Difference]: Without dead ends: 312 [2022-11-18 19:38:50,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:50,008 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 590 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:50,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 536 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:38:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-18 19:38:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-11-18 19:38:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 299 states have (on average 1.040133779264214) internal successors, (311), 311 states have internal predecessors, (311), 0 states have call successors, (0), 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-18 19:38:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 311 transitions. [2022-11-18 19:38:50,013 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 311 transitions. Word has length 264 [2022-11-18 19:38:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:50,013 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 311 transitions. [2022-11-18 19:38:50,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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-18 19:38:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 311 transitions. [2022-11-18 19:38:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-18 19:38:50,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:50,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:50,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-11-18 19:38:50,016 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631702, now seen corresponding path program 1 times [2022-11-18 19:38:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:50,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107259987] [2022-11-18 19:38:50,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:50,366 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-18 19:38:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:50,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107259987] [2022-11-18 19:38:50,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107259987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:50,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:50,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950203556] [2022-11-18 19:38:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:50,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:50,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:50,369 INFO L87 Difference]: Start difference. First operand 312 states and 311 transitions. Second operand has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 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-18 19:38:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:50,635 INFO L93 Difference]: Finished difference Result 311 states and 310 transitions. [2022-11-18 19:38:50,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:50,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 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) Word has length 269 [2022-11-18 19:38:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:50,637 INFO L225 Difference]: With dead ends: 311 [2022-11-18 19:38:50,638 INFO L226 Difference]: Without dead ends: 311 [2022-11-18 19:38:50,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:50,638 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 85 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:50,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 411 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-18 19:38:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-11-18 19:38:50,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 299 states have (on average 1.0367892976588629) internal successors, (310), 310 states have internal predecessors, (310), 0 states have call successors, (0), 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-18 19:38:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 310 transitions. [2022-11-18 19:38:50,644 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 310 transitions. Word has length 269 [2022-11-18 19:38:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:50,645 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 310 transitions. [2022-11-18 19:38:50,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 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-18 19:38:50,645 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 310 transitions. [2022-11-18 19:38:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-18 19:38:50,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:50,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:50,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-11-18 19:38:50,648 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631703, now seen corresponding path program 1 times [2022-11-18 19:38:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:50,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332459096] [2022-11-18 19:38:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:51,995 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-18 19:38:51,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:51,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332459096] [2022-11-18 19:38:51,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332459096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:51,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:51,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:51,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535013080] [2022-11-18 19:38:51,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:51,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:51,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:51,998 INFO L87 Difference]: Start difference. First operand 311 states and 310 transitions. Second operand has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 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-18 19:38:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:52,703 INFO L93 Difference]: Finished difference Result 310 states and 309 transitions. [2022-11-18 19:38:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:52,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 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) Word has length 269 [2022-11-18 19:38:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:52,706 INFO L225 Difference]: With dead ends: 310 [2022-11-18 19:38:52,706 INFO L226 Difference]: Without dead ends: 310 [2022-11-18 19:38:52,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:52,707 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 354 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:52,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 538 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-18 19:38:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2022-11-18 19:38:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.0334448160535117) internal successors, (309), 309 states have internal predecessors, (309), 0 states have call successors, (0), 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-18 19:38:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 309 transitions. [2022-11-18 19:38:52,713 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 309 transitions. Word has length 269 [2022-11-18 19:38:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:52,714 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 309 transitions. [2022-11-18 19:38:52,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 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-18 19:38:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 309 transitions. [2022-11-18 19:38:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-18 19:38:52,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:52,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:52,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-11-18 19:38:52,717 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:52,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:52,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655216, now seen corresponding path program 1 times [2022-11-18 19:38:52,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:52,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084555320] [2022-11-18 19:38:52,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:52,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:53,051 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-18 19:38:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:53,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084555320] [2022-11-18 19:38:53,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084555320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:53,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:53,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592258629] [2022-11-18 19:38:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:53,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:53,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:53,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:53,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:53,053 INFO L87 Difference]: Start difference. First operand 310 states and 309 transitions. Second operand has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 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-18 19:38:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:53,323 INFO L93 Difference]: Finished difference Result 309 states and 308 transitions. [2022-11-18 19:38:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 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) Word has length 274 [2022-11-18 19:38:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:53,325 INFO L225 Difference]: With dead ends: 309 [2022-11-18 19:38:53,325 INFO L226 Difference]: Without dead ends: 309 [2022-11-18 19:38:53,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:53,326 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 71 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:53,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 413 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:53,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-18 19:38:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2022-11-18 19:38:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 299 states have (on average 1.0301003344481605) internal successors, (308), 308 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-18 19:38:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 308 transitions. [2022-11-18 19:38:53,331 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 308 transitions. Word has length 274 [2022-11-18 19:38:53,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:53,332 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 308 transitions. [2022-11-18 19:38:53,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 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-18 19:38:53,332 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 308 transitions. [2022-11-18 19:38:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-18 19:38:53,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:53,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:53,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-11-18 19:38:53,334 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655217, now seen corresponding path program 1 times [2022-11-18 19:38:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:53,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635655424] [2022-11-18 19:38:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:54,187 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-18 19:38:54,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:54,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635655424] [2022-11-18 19:38:54,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635655424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:54,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:54,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:38:54,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363940494] [2022-11-18 19:38:54,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:54,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:38:54,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:54,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:38:54,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:38:54,189 INFO L87 Difference]: Start difference. First operand 309 states and 308 transitions. Second operand has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 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-18 19:38:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:54,836 INFO L93 Difference]: Finished difference Result 308 states and 307 transitions. [2022-11-18 19:38:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 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) Word has length 274 [2022-11-18 19:38:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:54,838 INFO L225 Difference]: With dead ends: 308 [2022-11-18 19:38:54,838 INFO L226 Difference]: Without dead ends: 308 [2022-11-18 19:38:54,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:38:54,838 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 379 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:54,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 499 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:38:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-18 19:38:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-11-18 19:38:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.0267558528428093) internal successors, (307), 307 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-18 19:38:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 307 transitions. [2022-11-18 19:38:54,841 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 307 transitions. Word has length 274 [2022-11-18 19:38:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:54,842 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 307 transitions. [2022-11-18 19:38:54,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 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-18 19:38:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 307 transitions. [2022-11-18 19:38:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-18 19:38:54,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:54,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:54,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-11-18 19:38:54,844 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash -572741209, now seen corresponding path program 1 times [2022-11-18 19:38:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:54,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96357980] [2022-11-18 19:38:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:55,203 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-18 19:38:55,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:55,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96357980] [2022-11-18 19:38:55,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96357980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:55,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:55,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:55,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276801986] [2022-11-18 19:38:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:55,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:55,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:55,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:55,205 INFO L87 Difference]: Start difference. First operand 308 states and 307 transitions. Second operand has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 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-18 19:38:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:55,470 INFO L93 Difference]: Finished difference Result 307 states and 306 transitions. [2022-11-18 19:38:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:55,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2022-11-18 19:38:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:55,472 INFO L225 Difference]: With dead ends: 307 [2022-11-18 19:38:55,472 INFO L226 Difference]: Without dead ends: 307 [2022-11-18 19:38:55,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:55,472 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 57 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:55,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 415 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-18 19:38:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-11-18 19:38:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 299 states have (on average 1.0234113712374582) internal successors, (306), 306 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-18 19:38:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 306 transitions. [2022-11-18 19:38:55,476 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 306 transitions. Word has length 279 [2022-11-18 19:38:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:55,477 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 306 transitions. [2022-11-18 19:38:55,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 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-18 19:38:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 306 transitions. [2022-11-18 19:38:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-18 19:38:55,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:55,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:55,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-11-18 19:38:55,480 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:55,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash -572741208, now seen corresponding path program 1 times [2022-11-18 19:38:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:55,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661343671] [2022-11-18 19:38:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:56,455 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-18 19:38:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661343671] [2022-11-18 19:38:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661343671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:56,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:56,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886122827] [2022-11-18 19:38:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:56,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:56,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:56,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:56,457 INFO L87 Difference]: Start difference. First operand 307 states and 306 transitions. Second operand has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 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-18 19:38:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:57,166 INFO L93 Difference]: Finished difference Result 306 states and 305 transitions. [2022-11-18 19:38:57,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:57,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2022-11-18 19:38:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:57,168 INFO L225 Difference]: With dead ends: 306 [2022-11-18 19:38:57,168 INFO L226 Difference]: Without dead ends: 306 [2022-11-18 19:38:57,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:57,168 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 339 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:57,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 583 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-18 19:38:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-11-18 19:38:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 299 states have (on average 1.020066889632107) internal successors, (305), 305 states have internal predecessors, (305), 0 states have call successors, (0), 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-18 19:38:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 305 transitions. [2022-11-18 19:38:57,172 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 305 transitions. Word has length 279 [2022-11-18 19:38:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:57,172 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 305 transitions. [2022-11-18 19:38:57,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 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-18 19:38:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 305 transitions. [2022-11-18 19:38:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-11-18 19:38:57,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:57,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:57,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-11-18 19:38:57,175 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:57,176 INFO L85 PathProgramCache]: Analyzing trace with hash 425407970, now seen corresponding path program 1 times [2022-11-18 19:38:57,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:57,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89455605] [2022-11-18 19:38:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:57,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:58,302 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-18 19:38:58,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:58,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89455605] [2022-11-18 19:38:58,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89455605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:58,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:58,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:38:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940063973] [2022-11-18 19:38:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:58,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:38:58,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:58,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:38:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:38:58,304 INFO L87 Difference]: Start difference. First operand 306 states and 305 transitions. Second operand has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 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-18 19:38:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:58,998 INFO L93 Difference]: Finished difference Result 305 states and 304 transitions. [2022-11-18 19:38:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:38:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2022-11-18 19:38:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:59,000 INFO L225 Difference]: With dead ends: 305 [2022-11-18 19:38:59,001 INFO L226 Difference]: Without dead ends: 305 [2022-11-18 19:38:59,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:38:59,001 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 332 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:59,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 544 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:38:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-18 19:38:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-11-18 19:38:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 299 states have (on average 1.0167224080267558) internal successors, (304), 304 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-18 19:38:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 304 transitions. [2022-11-18 19:38:59,007 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 304 transitions. Word has length 284 [2022-11-18 19:38:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:59,007 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 304 transitions. [2022-11-18 19:38:59,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 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-18 19:38:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 304 transitions. [2022-11-18 19:38:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-11-18 19:38:59,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:59,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:59,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-11-18 19:38:59,010 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash 425407969, now seen corresponding path program 1 times [2022-11-18 19:38:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:59,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979460056] [2022-11-18 19:38:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:38:59,348 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-18 19:38:59,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:38:59,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979460056] [2022-11-18 19:38:59,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979460056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:38:59,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:38:59,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:38:59,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157060280] [2022-11-18 19:38:59,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:38:59,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:38:59,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:38:59,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:38:59,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:38:59,351 INFO L87 Difference]: Start difference. First operand 305 states and 304 transitions. Second operand has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 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-18 19:38:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:38:59,618 INFO L93 Difference]: Finished difference Result 304 states and 303 transitions. [2022-11-18 19:38:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:38:59,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2022-11-18 19:38:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:38:59,620 INFO L225 Difference]: With dead ends: 304 [2022-11-18 19:38:59,620 INFO L226 Difference]: Without dead ends: 304 [2022-11-18 19:38:59,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:38:59,621 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 41 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:38:59,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 417 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:38:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-18 19:38:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-18 19:38:59,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 299 states have (on average 1.0133779264214047) internal successors, (303), 303 states have internal predecessors, (303), 0 states have call successors, (0), 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-18 19:38:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 303 transitions. [2022-11-18 19:38:59,626 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 303 transitions. Word has length 284 [2022-11-18 19:38:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:38:59,627 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 303 transitions. [2022-11-18 19:38:59,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 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-18 19:38:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 303 transitions. [2022-11-18 19:38:59,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-11-18 19:38:59,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:38:59,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:38:59,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-11-18 19:38:59,630 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:38:59,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:38:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858440, now seen corresponding path program 1 times [2022-11-18 19:38:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:38:59,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344964177] [2022-11-18 19:38:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:38:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:38:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:39:00,023 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-18 19:39:00,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:39:00,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344964177] [2022-11-18 19:39:00,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344964177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:39:00,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:39:00,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:39:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593175556] [2022-11-18 19:39:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:39:00,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:39:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:39:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:39:00,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:39:00,026 INFO L87 Difference]: Start difference. First operand 304 states and 303 transitions. Second operand has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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-18 19:39:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:39:00,293 INFO L93 Difference]: Finished difference Result 303 states and 302 transitions. [2022-11-18 19:39:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:39:00,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2022-11-18 19:39:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:39:00,295 INFO L225 Difference]: With dead ends: 303 [2022-11-18 19:39:00,295 INFO L226 Difference]: Without dead ends: 303 [2022-11-18 19:39:00,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:39:00,295 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 29 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:39:00,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 419 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:39:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-18 19:39:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2022-11-18 19:39:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.0100334448160535) internal successors, (302), 302 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-18 19:39:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 302 transitions. [2022-11-18 19:39:00,301 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 302 transitions. Word has length 289 [2022-11-18 19:39:00,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:39:00,301 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 302 transitions. [2022-11-18 19:39:00,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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-18 19:39:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 302 transitions. [2022-11-18 19:39:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-11-18 19:39:00,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:39:00,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:39:00,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-11-18 19:39:00,304 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:39:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:39:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858439, now seen corresponding path program 1 times [2022-11-18 19:39:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:39:00,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118719591] [2022-11-18 19:39:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:39:00,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:39:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:39:01,318 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-18 19:39:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:39:01,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118719591] [2022-11-18 19:39:01,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118719591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:39:01,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:39:01,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:39:01,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892828390] [2022-11-18 19:39:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:39:01,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:39:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:39:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:39:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:39:01,321 INFO L87 Difference]: Start difference. First operand 303 states and 302 transitions. Second operand has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 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-18 19:39:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:39:01,999 INFO L93 Difference]: Finished difference Result 302 states and 301 transitions. [2022-11-18 19:39:02,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:39:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2022-11-18 19:39:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:39:02,001 INFO L225 Difference]: With dead ends: 302 [2022-11-18 19:39:02,001 INFO L226 Difference]: Without dead ends: 302 [2022-11-18 19:39:02,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:39:02,007 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 525 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:39:02,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 546 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:39:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-18 19:39:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-11-18 19:39:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 299 states have (on average 1.0066889632107023) internal successors, (301), 301 states have internal predecessors, (301), 0 states have call successors, (0), 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-18 19:39:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 301 transitions. [2022-11-18 19:39:02,012 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 301 transitions. Word has length 289 [2022-11-18 19:39:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:39:02,012 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 301 transitions. [2022-11-18 19:39:02,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 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-18 19:39:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 301 transitions. [2022-11-18 19:39:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-11-18 19:39:02,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:39:02,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:39:02,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-11-18 19:39:02,015 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:39:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:39:02,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445102, now seen corresponding path program 1 times [2022-11-18 19:39:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:39:02,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624704582] [2022-11-18 19:39:02,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:39:02,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:39:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:39:02,451 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-18 19:39:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:39:02,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624704582] [2022-11-18 19:39:02,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624704582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:39:02,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:39:02,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:39:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846826068] [2022-11-18 19:39:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:39:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:39:02,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:39:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:39:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:39:02,453 INFO L87 Difference]: Start difference. First operand 302 states and 301 transitions. Second operand has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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-18 19:39:02,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:39:02,718 INFO L93 Difference]: Finished difference Result 301 states and 300 transitions. [2022-11-18 19:39:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:39:02,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2022-11-18 19:39:02,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:39:02,720 INFO L225 Difference]: With dead ends: 301 [2022-11-18 19:39:02,720 INFO L226 Difference]: Without dead ends: 301 [2022-11-18 19:39:02,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:39:02,723 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 19:39:02,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 19:39:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-18 19:39:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-11-18 19:39:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 299 states have (on average 1.0033444816053512) internal successors, (300), 300 states have internal predecessors, (300), 0 states have call successors, (0), 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-18 19:39:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 300 transitions. [2022-11-18 19:39:02,730 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 300 transitions. Word has length 294 [2022-11-18 19:39:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:39:02,731 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 300 transitions. [2022-11-18 19:39:02,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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-18 19:39:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 300 transitions. [2022-11-18 19:39:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-11-18 19:39:02,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:39:02,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:39:02,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-11-18 19:39:02,733 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:39:02,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:39:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445101, now seen corresponding path program 1 times [2022-11-18 19:39:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:39:02,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963215785] [2022-11-18 19:39:02,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:39:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:39:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:39:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:39:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:39:03,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963215785] [2022-11-18 19:39:03,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963215785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:39:03,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:39:03,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:39:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120133956] [2022-11-18 19:39:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:39:03,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:39:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:39:03,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:39:03,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:39:03,675 INFO L87 Difference]: Start difference. First operand 301 states and 300 transitions. Second operand has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 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-18 19:39:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:39:04,306 INFO L93 Difference]: Finished difference Result 300 states and 299 transitions. [2022-11-18 19:39:04,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:39:04,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2022-11-18 19:39:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:39:04,308 INFO L225 Difference]: With dead ends: 300 [2022-11-18 19:39:04,308 INFO L226 Difference]: Without dead ends: 300 [2022-11-18 19:39:04,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:39:04,308 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 307 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:39:04,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 507 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 19:39:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-18 19:39:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-11-18 19:39:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.0) internal successors, (299), 299 states have internal predecessors, (299), 0 states have call successors, (0), 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-18 19:39:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 299 transitions. [2022-11-18 19:39:04,319 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 299 transitions. Word has length 294 [2022-11-18 19:39:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:39:04,320 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 299 transitions. [2022-11-18 19:39:04,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 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-18 19:39:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 299 transitions. [2022-11-18 19:39:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-11-18 19:39:04,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:39:04,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:39:04,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-11-18 19:39:04,323 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-18 19:39:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:39:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash -922991286, now seen corresponding path program 1 times [2022-11-18 19:39:04,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:39:04,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682779711] [2022-11-18 19:39:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:39:04,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:39:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:39:07,130 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-18 19:39:07,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:39:07,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682779711] [2022-11-18 19:39:07,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682779711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:39:07,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:39:07,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:39:07,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155640557] [2022-11-18 19:39:07,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:39:07,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:39:07,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:39:07,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:39:07,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:39:07,132 INFO L87 Difference]: Start difference. First operand 300 states and 299 transitions. Second operand has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 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-18 19:39:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:39:07,909 INFO L93 Difference]: Finished difference Result 297 states and 296 transitions. [2022-11-18 19:39:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:39:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 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 299 [2022-11-18 19:39:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:39:07,910 INFO L225 Difference]: With dead ends: 297 [2022-11-18 19:39:07,910 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 19:39:07,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:39:07,910 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 222 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:39:07,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 705 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 19:39:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 19:39:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 19:39:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-18 19:39:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 19:39:07,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2022-11-18 19:39:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:39:07,912 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 19:39:07,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 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-18 19:39:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 19:39:07,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 19:39:07,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (167 of 168 remaining) [2022-11-18 19:39:07,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (166 of 168 remaining) [2022-11-18 19:39:07,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (165 of 168 remaining) [2022-11-18 19:39:07,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (164 of 168 remaining) [2022-11-18 19:39:07,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (163 of 168 remaining) [2022-11-18 19:39:07,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (162 of 168 remaining) [2022-11-18 19:39:07,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 168 remaining) [2022-11-18 19:39:07,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 168 remaining) [2022-11-18 19:39:07,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 168 remaining) [2022-11-18 19:39:07,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 168 remaining) [2022-11-18 19:39:07,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 168 remaining) [2022-11-18 19:39:07,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 168 remaining) [2022-11-18 19:39:07,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 168 remaining) [2022-11-18 19:39:07,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 168 remaining) [2022-11-18 19:39:07,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 168 remaining) [2022-11-18 19:39:07,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 168 remaining) [2022-11-18 19:39:07,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 168 remaining) [2022-11-18 19:39:07,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 168 remaining) [2022-11-18 19:39:07,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 168 remaining) [2022-11-18 19:39:07,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 168 remaining) [2022-11-18 19:39:07,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 168 remaining) [2022-11-18 19:39:07,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 168 remaining) [2022-11-18 19:39:07,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 168 remaining) [2022-11-18 19:39:07,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 168 remaining) [2022-11-18 19:39:07,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 168 remaining) [2022-11-18 19:39:07,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 168 remaining) [2022-11-18 19:39:07,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 168 remaining) [2022-11-18 19:39:07,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 168 remaining) [2022-11-18 19:39:07,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 168 remaining) [2022-11-18 19:39:07,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 168 remaining) [2022-11-18 19:39:07,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 168 remaining) [2022-11-18 19:39:07,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 168 remaining) [2022-11-18 19:39:07,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 168 remaining) [2022-11-18 19:39:07,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 168 remaining) [2022-11-18 19:39:07,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 168 remaining) [2022-11-18 19:39:07,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 168 remaining) [2022-11-18 19:39:07,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 168 remaining) [2022-11-18 19:39:07,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 168 remaining) [2022-11-18 19:39:07,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 168 remaining) [2022-11-18 19:39:07,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 168 remaining) [2022-11-18 19:39:07,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 168 remaining) [2022-11-18 19:39:07,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 168 remaining) [2022-11-18 19:39:07,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 168 remaining) [2022-11-18 19:39:07,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 168 remaining) [2022-11-18 19:39:07,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 168 remaining) [2022-11-18 19:39:07,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 168 remaining) [2022-11-18 19:39:07,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 168 remaining) [2022-11-18 19:39:07,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 168 remaining) [2022-11-18 19:39:07,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 168 remaining) [2022-11-18 19:39:07,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 168 remaining) [2022-11-18 19:39:07,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 168 remaining) [2022-11-18 19:39:07,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 168 remaining) [2022-11-18 19:39:07,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 168 remaining) [2022-11-18 19:39:07,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 168 remaining) [2022-11-18 19:39:07,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 168 remaining) [2022-11-18 19:39:07,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 168 remaining) [2022-11-18 19:39:07,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 168 remaining) [2022-11-18 19:39:07,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 168 remaining) [2022-11-18 19:39:07,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 168 remaining) [2022-11-18 19:39:07,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 168 remaining) [2022-11-18 19:39:07,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 168 remaining) [2022-11-18 19:39:07,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 168 remaining) [2022-11-18 19:39:07,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 168 remaining) [2022-11-18 19:39:07,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 168 remaining) [2022-11-18 19:39:07,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 168 remaining) [2022-11-18 19:39:07,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 168 remaining) [2022-11-18 19:39:07,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 168 remaining) [2022-11-18 19:39:07,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 168 remaining) [2022-11-18 19:39:07,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 168 remaining) [2022-11-18 19:39:07,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 168 remaining) [2022-11-18 19:39:07,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 168 remaining) [2022-11-18 19:39:07,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 168 remaining) [2022-11-18 19:39:07,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 168 remaining) [2022-11-18 19:39:07,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 168 remaining) [2022-11-18 19:39:07,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 168 remaining) [2022-11-18 19:39:07,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 168 remaining) [2022-11-18 19:39:07,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 168 remaining) [2022-11-18 19:39:07,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 168 remaining) [2022-11-18 19:39:07,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 168 remaining) [2022-11-18 19:39:07,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 168 remaining) [2022-11-18 19:39:07,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 168 remaining) [2022-11-18 19:39:07,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 168 remaining) [2022-11-18 19:39:07,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 168 remaining) [2022-11-18 19:39:07,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 168 remaining) [2022-11-18 19:39:07,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 168 remaining) [2022-11-18 19:39:07,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 168 remaining) [2022-11-18 19:39:07,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 168 remaining) [2022-11-18 19:39:07,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 168 remaining) [2022-11-18 19:39:07,937 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 168 remaining) [2022-11-18 19:39:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 168 remaining) [2022-11-18 19:39:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 168 remaining) [2022-11-18 19:39:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 168 remaining) [2022-11-18 19:39:07,938 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 168 remaining) [2022-11-18 19:39:07,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 168 remaining) [2022-11-18 19:39:07,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 168 remaining) [2022-11-18 19:39:07,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 168 remaining) [2022-11-18 19:39:07,939 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 168 remaining) [2022-11-18 19:39:07,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 168 remaining) [2022-11-18 19:39:07,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 168 remaining) [2022-11-18 19:39:07,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 168 remaining) [2022-11-18 19:39:07,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 168 remaining) [2022-11-18 19:39:07,940 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 168 remaining) [2022-11-18 19:39:07,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 168 remaining) [2022-11-18 19:39:07,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 168 remaining) [2022-11-18 19:39:07,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 168 remaining) [2022-11-18 19:39:07,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 168 remaining) [2022-11-18 19:39:07,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 168 remaining) [2022-11-18 19:39:07,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 168 remaining) [2022-11-18 19:39:07,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 168 remaining) [2022-11-18 19:39:07,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 168 remaining) [2022-11-18 19:39:07,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 168 remaining) [2022-11-18 19:39:07,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 168 remaining) [2022-11-18 19:39:07,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 168 remaining) [2022-11-18 19:39:07,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 168 remaining) [2022-11-18 19:39:07,943 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 168 remaining) [2022-11-18 19:39:07,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 168 remaining) [2022-11-18 19:39:07,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 168 remaining) [2022-11-18 19:39:07,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 168 remaining) [2022-11-18 19:39:07,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 168 remaining) [2022-11-18 19:39:07,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 168 remaining) [2022-11-18 19:39:07,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 168 remaining) [2022-11-18 19:39:07,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 168 remaining) [2022-11-18 19:39:07,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 168 remaining) [2022-11-18 19:39:07,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 168 remaining) [2022-11-18 19:39:07,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 168 remaining) [2022-11-18 19:39:07,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 168 remaining) [2022-11-18 19:39:07,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 168 remaining) [2022-11-18 19:39:07,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 168 remaining) [2022-11-18 19:39:07,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 168 remaining) [2022-11-18 19:39:07,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 168 remaining) [2022-11-18 19:39:07,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 168 remaining) [2022-11-18 19:39:07,947 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 168 remaining) [2022-11-18 19:39:07,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 168 remaining) [2022-11-18 19:39:07,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 168 remaining) [2022-11-18 19:39:07,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 168 remaining) [2022-11-18 19:39:07,948 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 168 remaining) [2022-11-18 19:39:07,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 168 remaining) [2022-11-18 19:39:07,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 168 remaining) [2022-11-18 19:39:07,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 168 remaining) [2022-11-18 19:39:07,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 168 remaining) [2022-11-18 19:39:07,949 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 168 remaining) [2022-11-18 19:39:07,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 168 remaining) [2022-11-18 19:39:07,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 168 remaining) [2022-11-18 19:39:07,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 168 remaining) [2022-11-18 19:39:07,950 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 168 remaining) [2022-11-18 19:39:07,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 168 remaining) [2022-11-18 19:39:07,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 168 remaining) [2022-11-18 19:39:07,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 168 remaining) [2022-11-18 19:39:07,951 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 168 remaining) [2022-11-18 19:39:07,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 168 remaining) [2022-11-18 19:39:07,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 168 remaining) [2022-11-18 19:39:07,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 168 remaining) [2022-11-18 19:39:07,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 168 remaining) [2022-11-18 19:39:07,952 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 168 remaining) [2022-11-18 19:39:07,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 168 remaining) [2022-11-18 19:39:07,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 168 remaining) [2022-11-18 19:39:07,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 168 remaining) [2022-11-18 19:39:07,953 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 168 remaining) [2022-11-18 19:39:07,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 168 remaining) [2022-11-18 19:39:07,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 168 remaining) [2022-11-18 19:39:07,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 168 remaining) [2022-11-18 19:39:07,954 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 168 remaining) [2022-11-18 19:39:07,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 168 remaining) [2022-11-18 19:39:07,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 168 remaining) [2022-11-18 19:39:07,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 168 remaining) [2022-11-18 19:39:07,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 168 remaining) [2022-11-18 19:39:07,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK (1 of 168 remaining) [2022-11-18 19:39:07,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK (0 of 168 remaining) [2022-11-18 19:39:07,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-11-18 19:39:07,960 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:39:07,964 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:39:07,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:39:07 BoogieIcfgContainer [2022-11-18 19:39:07,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:39:07,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:39:07,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:39:07,969 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:39:07,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:37:20" (3/4) ... [2022-11-18 19:39:07,974 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 19:39:08,010 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 210 nodes and edges [2022-11-18 19:39:08,013 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-18 19:39:08,016 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-18 19:39:08,019 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-18 19:39:08,022 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 19:39:08,025 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 19:39:08,029 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 19:39:08,375 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:39:08,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:39:08,376 INFO L158 Benchmark]: Toolchain (without parser) took 111371.01ms. Allocated memory was 121.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 84.7MB in the beginning and 629.7MB in the end (delta: -545.0MB). Peak memory consumption was 831.4MB. Max. memory is 16.1GB. [2022-11-18 19:39:08,376 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:39:08,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 950.18ms. Allocated memory is still 121.6MB. Free memory was 84.5MB in the beginning and 73.7MB in the end (delta: 10.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-18 19:39:08,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.68ms. Allocated memory is still 121.6MB. Free memory was 73.7MB in the beginning and 64.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 19:39:08,377 INFO L158 Benchmark]: Boogie Preprocessor took 110.67ms. Allocated memory is still 121.6MB. Free memory was 64.9MB in the beginning and 53.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 19:39:08,377 INFO L158 Benchmark]: RCFGBuilder took 2431.78ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 53.5MB in the beginning and 87.5MB in the end (delta: -34.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-11-18 19:39:08,377 INFO L158 Benchmark]: TraceAbstraction took 107329.48ms. Allocated memory was 157.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.4MB in the beginning and 669.5MB in the end (delta: -583.1MB). Peak memory consumption was 760.1MB. Max. memory is 16.1GB. [2022-11-18 19:39:08,378 INFO L158 Benchmark]: Witness Printer took 406.90ms. Allocated memory is still 1.5GB. Free memory was 669.5MB in the beginning and 629.7MB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-18 19:39:08,378 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 950.18ms. Allocated memory is still 121.6MB. Free memory was 84.5MB in the beginning and 73.7MB in the end (delta: 10.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.68ms. Allocated memory is still 121.6MB. Free memory was 73.7MB in the beginning and 64.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.67ms. Allocated memory is still 121.6MB. Free memory was 64.9MB in the beginning and 53.5MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2431.78ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 53.5MB in the beginning and 87.5MB in the end (delta: -34.0MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 107329.48ms. Allocated memory was 157.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.4MB in the beginning and 669.5MB in the end (delta: -583.1MB). Peak memory consumption was 760.1MB. Max. memory is 16.1GB. * Witness Printer took 406.90ms. Allocated memory is still 1.5GB. Free memory was 669.5MB in the beginning and 629.7MB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1287]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 470 locations, 168 error locations. Started 1 CEGAR loops. OverallTime: 107.2s, OverallIterations: 91, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 49.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45277 SdHoareTripleChecker+Valid, 42.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45277 mSDsluCounter, 41545 SdHoareTripleChecker+Invalid, 35.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19419 mSDsCounter, 2049 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28887 IncrementalHoareTripleChecker+Invalid, 30936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2049 mSolverCounterUnsat, 22126 mSDtfsCounter, 28887 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=0, InterpolantAutomatonStates: 539, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 91 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 5.9s SatisfiabilityAnalysisTime, 45.4s InterpolantComputationTime, 16665 NumberOfCodeBlocks, 16665 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 16574 ConstructedInterpolants, 0 QuantifiedInterpolants, 83472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 91 InterpolantComputations, 91 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 168 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-18 19:39:08,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_479e8f35-0e6c-451e-8c5a-0e0959041e95/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE