./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc --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 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 --- 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-5e519f3 [2022-11-02 20:47:34,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:34,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:34,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:34,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:34,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:34,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:34,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:34,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:34,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:34,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:34,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:34,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:34,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:34,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:34,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:34,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:34,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:34,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:34,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:34,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:34,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:34,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:34,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:34,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:34,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:34,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:34,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:34,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:34,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:34,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:34,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:34,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:34,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:34,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:34,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:34,195 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:34,195 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:34,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:34,196 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:34,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:34,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:47:34,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:34,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:34,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:34,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:34,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:34,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:34,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:34,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:34,238 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:34,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:34,240 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:34,240 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:47:34,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:34,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:34,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:34,241 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:47:34,242 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:47:34,242 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:47:34,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:34,242 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:47:34,243 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:34,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:34,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:34,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:34,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:34,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:34,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:34,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:34,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:34,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:34,245 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_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/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_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc 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 -> 46bbe683d8965e9a855fbd780578b958a816bbdd25bc1fa0d6151e1b826f8669 [2022-11-02 20:47:34,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:34,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:34,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:34,622 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:34,623 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:34,624 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2022-11-02 20:47:34,710 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/data/2de88615c/2cd42567dd8f4fb4b9e2dc3478ef4ad0/FLAGa68f502ad [2022-11-02 20:47:35,202 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:35,204 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i [2022-11-02 20:47:35,218 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/data/2de88615c/2cd42567dd8f4fb4b9e2dc3478ef4ad0/FLAGa68f502ad [2022-11-02 20:47:35,533 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/data/2de88615c/2cd42567dd8f4fb4b9e2dc3478ef4ad0 [2022-11-02 20:47:35,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:35,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:35,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:35,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:35,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:35,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:35" (1/1) ... [2022-11-02 20:47:35,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65ebbd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:35, skipping insertion in model container [2022-11-02 20:47:35,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:35" (1/1) ... [2022-11-02 20:47:35,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:35,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:35,926 WARN L230 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_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-11-02 20:47:35,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:35,948 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:36,020 WARN L230 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_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/sv-benchmarks/c/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-11-02 20:47:36,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:36,054 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:36,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36 WrapperNode [2022-11-02 20:47:36,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:36,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:36,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:36,058 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:36,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,140 INFO L138 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2022-11-02 20:47:36,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:36,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:36,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:36,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:36,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,167 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:36,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:36,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:36,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:36,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (1/1) ... [2022-11-02 20:47:36,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:36,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:36,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:47:36,249 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:47:36,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:47:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:47:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:47:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:47:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:47:36,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:47:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:47:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:47:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:47:36,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:36,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:36,398 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:36,401 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:36,449 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:47:36,855 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:47:36,863 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:47:36,863 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:47:36,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:36 BoogieIcfgContainer [2022-11-02 20:47:36,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:47:36,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:47:36,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:47:36,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:47:36,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:35" (1/3) ... [2022-11-02 20:47:36,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fceef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:36, skipping insertion in model container [2022-11-02 20:47:36,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:36" (2/3) ... [2022-11-02 20:47:36,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71fceef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:36, skipping insertion in model container [2022-11-02 20:47:36,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:36" (3/3) ... [2022-11-02 20:47:36,892 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.i [2022-11-02 20:47:36,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:47:36,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-02 20:47:36,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:36,994 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;@3edc94f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:36,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-02 20:47:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 50 states have (on average 2.06) internal successors, (103), 92 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:37,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:37,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:37,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-02 20:47:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:37,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422530889] [2022-11-02 20:47:37,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:37,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:37,271 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-02 20:47:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:37,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422530889] [2022-11-02 20:47:37,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422530889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:37,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:37,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776032637] [2022-11-02 20:47:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:37,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:37,315 INFO L87 Difference]: Start difference. First operand has 94 states, 50 states have (on average 2.06) internal successors, (103), 92 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:37,480 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2022-11-02 20:47:37,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:37,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:37,490 INFO L225 Difference]: With dead ends: 161 [2022-11-02 20:47:37,491 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:47:37,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:37,496 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 84 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:37,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 176 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:47:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 85. [2022-11-02 20:47:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-11-02 20:47:37,535 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 5 [2022-11-02 20:47:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:37,535 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-11-02 20:47:37,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-11-02 20:47:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:37,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:37,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:47:37,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:37,538 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-02 20:47:37,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:37,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741536193] [2022-11-02 20:47:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:37,721 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-02 20:47:37,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:37,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741536193] [2022-11-02 20:47:37,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741536193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:37,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:37,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:37,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732828030] [2022-11-02 20:47:37,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:37,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:37,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:37,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:37,730 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:37,911 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2022-11-02 20:47:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:37,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-02 20:47:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:37,918 INFO L225 Difference]: With dead ends: 153 [2022-11-02 20:47:37,918 INFO L226 Difference]: Without dead ends: 153 [2022-11-02 20:47:37,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:37,920 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 82 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:37,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 170 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-02 20:47:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 82. [2022-11-02 20:47:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.851063829787234) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-02 20:47:37,928 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 5 [2022-11-02 20:47:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:37,929 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-02 20:47:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-02 20:47:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:47:37,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:37,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:37,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:47:37,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113040, now seen corresponding path program 1 times [2022-11-02 20:47:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:37,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026066247] [2022-11-02 20:47:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:37,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-02 20:47:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:37,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026066247] [2022-11-02 20:47:37,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026066247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:37,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:37,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639523984] [2022-11-02 20:47:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:37,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:38,000 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:38,008 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-11-02 20:47:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-02 20:47:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:38,010 INFO L225 Difference]: With dead ends: 92 [2022-11-02 20:47:38,010 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 20:47:38,010 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-02 20:47:38,012 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:38,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 20:47:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2022-11-02 20:47:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 82 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-02 20:47:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-02 20:47:38,034 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 7 [2022-11-02 20:47:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:38,035 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-02 20:47:38,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-02 20:47:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:38,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:38,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:38,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:47:38,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:38,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:38,036 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-02 20:47:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:38,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615718] [2022-11-02 20:47:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,145 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-02 20:47:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:38,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615718] [2022-11-02 20:47:38,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:38,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:38,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312545115] [2022-11-02 20:47:38,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:38,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:38,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:38,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:38,150 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:38,173 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-11-02 20:47:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-02 20:47:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:38,176 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:47:38,176 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:47:38,177 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-02 20:47:38,186 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:38,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:47:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-11-02 20:47:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-02 20:47:38,193 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 9 [2022-11-02 20:47:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:38,193 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-02 20:47:38,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-02 20:47:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:47:38,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:38,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:38,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:47:38,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -763066913, now seen corresponding path program 1 times [2022-11-02 20:47:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:38,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18005946] [2022-11-02 20:47:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18005946] [2022-11-02 20:47:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18005946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595823722] [2022-11-02 20:47:38,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:38,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:38,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:38,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:47:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:47:38,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:38,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:38,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595823722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:38,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:38,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:47:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974253025] [2022-11-02 20:47:38,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:38,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:38,533 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:38,549 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-11-02 20:47:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:47:38,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:47:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:38,550 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:47:38,550 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:47:38,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:38,552 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 16 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:38,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:47:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-02 20:47:38,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-02 20:47:38,558 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 14 [2022-11-02 20:47:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:38,558 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-02 20:47:38,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-02 20:47:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:38,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:38,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:38,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:38,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:38,766 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-02 20:47:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:38,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076643396] [2022-11-02 20:47:38,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:39,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076643396] [2022-11-02 20:47:39,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076643396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:39,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082632569] [2022-11-02 20:47:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:39,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:39,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:39,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:47:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:39,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:47:39,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:39,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:39,288 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:47:39,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:47:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:39,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:39,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082632569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:39,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:39,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 20:47:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539740382] [2022-11-02 20:47:39,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:39,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:47:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:47:39,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:39,437 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:39,548 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-11-02 20:47:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:47:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:47:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:39,550 INFO L225 Difference]: With dead ends: 101 [2022-11-02 20:47:39,550 INFO L226 Difference]: Without dead ends: 101 [2022-11-02 20:47:39,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:39,551 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 156 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:39,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 85 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-11-02 20:47:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-02 20:47:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2022-11-02 20:47:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.709090909090909) internal successors, (94), 88 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-02 20:47:39,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-11-02 20:47:39,557 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 16 [2022-11-02 20:47:39,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:39,557 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-11-02 20:47:39,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:39,558 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-11-02 20:47:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:39,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:39,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:39,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:39,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:39,775 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:39,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-02 20:47:39,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:39,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769881855] [2022-11-02 20:47:39,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769881855] [2022-11-02 20:47:40,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769881855] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717607009] [2022-11-02 20:47:40,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:40,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:40,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:40,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:47:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:40,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:47:40,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:40,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:40,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:40,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:40,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:40,251 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:47:40,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:47:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:40,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:40,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717607009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:40,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:40,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-11-02 20:47:40,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067766470] [2022-11-02 20:47:40,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:40,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:40,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:40,619 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:40,796 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-11-02 20:47:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:40,798 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:47:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:40,800 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:47:40,800 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 20:47:40,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:47:40,802 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 343 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:40,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 67 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 93 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-11-02 20:47:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 20:47:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2022-11-02 20:47:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.690909090909091) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:40,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-02 20:47:40,812 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 16 [2022-11-02 20:47:40,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:40,812 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-02 20:47:40,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-02 20:47:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:47:40,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:40,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:40,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:41,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:41,014 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957328, now seen corresponding path program 2 times [2022-11-02 20:47:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:41,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127783673] [2022-11-02 20:47:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127783673] [2022-11-02 20:47:41,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127783673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297605967] [2022-11-02 20:47:41,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:47:41,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:41,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:41,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:41,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:47:41,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-02 20:47:41,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:47:41,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:47:41,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:41,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:41,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:41,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297605967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:41,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:47:41,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-02 20:47:41,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140120758] [2022-11-02 20:47:41,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:41,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:41,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:41,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:41,224 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:41,293 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-11-02 20:47:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:41,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:47:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:41,294 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:47:41,295 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 20:47:41,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:41,296 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:41,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 63 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 20:47:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2022-11-02 20:47:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-11-02 20:47:41,300 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 21 [2022-11-02 20:47:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:41,301 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-11-02 20:47:41,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-11-02 20:47:41,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:47:41,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:41,302 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:41,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:41,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:47:41,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957327, now seen corresponding path program 1 times [2022-11-02 20:47:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067554808] [2022-11-02 20:47:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:41,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:41,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067554808] [2022-11-02 20:47:41,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067554808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:41,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620944283] [2022-11-02 20:47:41,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:41,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:41,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:47:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:41,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:47:41,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:41,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620944283] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:41,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:41,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-02 20:47:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796361404] [2022-11-02 20:47:41,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:41,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:47:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:41,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:47:41,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:47:41,780 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:41,813 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-02 20:47:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:47:41,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:47:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:41,815 INFO L225 Difference]: With dead ends: 85 [2022-11-02 20:47:41,815 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:47:41,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-02 20:47:41,817 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 147 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:41,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 78 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:47:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:47:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-02 20:47:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 84 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-02 20:47:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-02 20:47:41,836 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 21 [2022-11-02 20:47:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:41,837 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-02 20:47:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-02 20:47:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:47:41,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:41,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:41,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:42,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:47:42,053 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822092, now seen corresponding path program 1 times [2022-11-02 20:47:42,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:42,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918748997] [2022-11-02 20:47:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:42,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:42,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918748997] [2022-11-02 20:47:42,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918748997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:42,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:42,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830498566] [2022-11-02 20:47:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:42,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:42,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:42,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:42,165 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:42,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:42,219 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-02 20:47:42,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:42,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:47:42,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:42,220 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:47:42,220 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:47:42,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:42,221 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 64 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:42,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 58 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:47:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-02 20:47:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-11-02 20:47:42,228 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 22 [2022-11-02 20:47:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:42,230 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-11-02 20:47:42,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-11-02 20:47:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:47:42,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:42,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:42,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:47:42,234 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 157247510, now seen corresponding path program 1 times [2022-11-02 20:47:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:42,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257204081] [2022-11-02 20:47:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:47:42,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:42,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257204081] [2022-11-02 20:47:42,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257204081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:42,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512159737] [2022-11-02 20:47:42,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:42,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:42,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:42,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:42,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:47:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:42,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:47:42,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:42,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:42,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:42,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:42,808 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:47:42,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:42,851 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:47:42,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:47:42,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:47:42,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512159737] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:42,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:42,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2022-11-02 20:47:42,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611829896] [2022-11-02 20:47:42,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:42,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:47:42,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:42,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:47:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:42,982 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:43,083 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-11-02 20:47:43,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:43,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:47:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:43,085 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:47:43,085 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:47:43,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:43,087 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 135 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:43,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 103 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-11-02 20:47:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:47:43,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2022-11-02 20:47:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-02 20:47:43,094 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 27 [2022-11-02 20:47:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:43,095 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-02 20:47:43,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-02 20:47:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:47:43,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:43,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:43,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:43,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:47:43,314 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash 157247511, now seen corresponding path program 1 times [2022-11-02 20:47:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671121876] [2022-11-02 20:47:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:43,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:43,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671121876] [2022-11-02 20:47:43,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671121876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:43,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986029264] [2022-11-02 20:47:43,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:43,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:43,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:43,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:43,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:47:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:44,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-02 20:47:44,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:44,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:44,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:44,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:44,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:44,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:44,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:44,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:47:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:44,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:47:44,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986029264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:44,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:47:44,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2022-11-02 20:47:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616516256] [2022-11-02 20:47:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:44,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:47:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:44,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:47:44,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:44,260 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:44,336 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-11-02 20:47:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:47:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:44,337 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:47:44,337 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:47:44,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:44,338 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 97 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:44,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 46 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:47:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 20:47:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-11-02 20:47:44,341 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 27 [2022-11-02 20:47:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:44,342 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-11-02 20:47:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-11-02 20:47:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:47:44,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:44,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:44,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:47:44,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:44,574 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 579705555, now seen corresponding path program 1 times [2022-11-02 20:47:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:44,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700216061] [2022-11-02 20:47:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:44,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:44,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700216061] [2022-11-02 20:47:44,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700216061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:44,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:44,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:47:44,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735279697] [2022-11-02 20:47:44,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:44,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:44,683 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:44,774 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-11-02 20:47:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:44,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:47:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:44,775 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:47:44,775 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:47:44,776 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-02 20:47:44,776 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 132 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:44,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 83 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:47:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2022-11-02 20:47:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-11-02 20:47:44,779 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 28 [2022-11-02 20:47:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:44,780 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-11-02 20:47:44,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-11-02 20:47:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:47:44,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:44,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:44,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:47:44,781 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 579705556, now seen corresponding path program 1 times [2022-11-02 20:47:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:44,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067132485] [2022-11-02 20:47:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:44,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067132485] [2022-11-02 20:47:44,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067132485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:44,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:44,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:47:44,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350751523] [2022-11-02 20:47:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:44,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:44,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:44,954 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:45,040 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-11-02 20:47:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:47:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:45,041 INFO L225 Difference]: With dead ends: 68 [2022-11-02 20:47:45,042 INFO L226 Difference]: Without dead ends: 68 [2022-11-02 20:47:45,042 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-02 20:47:45,042 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:45,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 62 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-02 20:47:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-02 20:47:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.309090909090909) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-11-02 20:47:45,045 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 28 [2022-11-02 20:47:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:45,046 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-11-02 20:47:45,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-11-02 20:47:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:45,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:45,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:45,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:47:45,047 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558015, now seen corresponding path program 1 times [2022-11-02 20:47:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:45,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905697496] [2022-11-02 20:47:45,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:47:45,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:45,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905697496] [2022-11-02 20:47:45,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905697496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:45,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:45,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:45,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740321501] [2022-11-02 20:47:45,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:45,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:47:45,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:45,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:47:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:47:45,507 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:45,937 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-11-02 20:47:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:45,938 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:47:45,938 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:47:45,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:45,939 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 175 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:45,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 139 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:47:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-11-02 20:47:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.290909090909091) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-11-02 20:47:45,941 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 33 [2022-11-02 20:47:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:45,941 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-11-02 20:47:45,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-11-02 20:47:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:47:45,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:45,942 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:45,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:47:45,942 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1569558014, now seen corresponding path program 1 times [2022-11-02 20:47:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:45,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891079605] [2022-11-02 20:47:45,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:47:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:46,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891079605] [2022-11-02 20:47:46,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891079605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:46,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:46,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:47:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249828260] [2022-11-02 20:47:46,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:46,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:46,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:46,809 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:47,252 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-11-02 20:47:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:47,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:47:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:47,254 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:47:47,254 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 20:47:47,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:47,256 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 204 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:47,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 160 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 20:47:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-11-02 20:47:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-11-02 20:47:47,261 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 33 [2022-11-02 20:47:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:47,262 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-11-02 20:47:47,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-11-02 20:47:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:47:47,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:47,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:47:47,266 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:47,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1306141903, now seen corresponding path program 1 times [2022-11-02 20:47:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940162032] [2022-11-02 20:47:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:47,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940162032] [2022-11-02 20:47:47,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940162032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:47,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:47,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131416191] [2022-11-02 20:47:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:47,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:47:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:47:47,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:47,582 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:47,782 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-11-02 20:47:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:47:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:47:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:47,783 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:47:47,783 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 20:47:47,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:47,784 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 259 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:47,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 145 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 20:47:47,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-11-02 20:47:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.280701754385965) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-11-02 20:47:47,787 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 37 [2022-11-02 20:47:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:47,787 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-11-02 20:47:47,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-11-02 20:47:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:47:47,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:47,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:47,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:47:47,788 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:47,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1306141904, now seen corresponding path program 1 times [2022-11-02 20:47:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:47,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651812558] [2022-11-02 20:47:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:48,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651812558] [2022-11-02 20:47:48,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651812558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:48,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:48,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:47:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018378064] [2022-11-02 20:47:48,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:48,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:48,280 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:48,538 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-02 20:47:48,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:47:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:47:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:48,539 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:47:48,539 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:47:48,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:48,540 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 262 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:48,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 128 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:47:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2022-11-02 20:47:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-02 20:47:48,543 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 37 [2022-11-02 20:47:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:48,543 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-02 20:47:48,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-02 20:47:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:47:48,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:48,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:48,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:47:48,544 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:48,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1835692060, now seen corresponding path program 1 times [2022-11-02 20:47:48,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:48,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775436242] [2022-11-02 20:47:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:47:48,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:48,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775436242] [2022-11-02 20:47:48,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775436242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:48,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:48,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:48,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861339933] [2022-11-02 20:47:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:48,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:48,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:48,815 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:48,973 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-11-02 20:47:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-02 20:47:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:48,974 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:47:48,974 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:47:48,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:48,975 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 177 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:48,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 171 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:47:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-11-02 20:47:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-11-02 20:47:48,978 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 38 [2022-11-02 20:47:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:48,979 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-11-02 20:47:48,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-11-02 20:47:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:47:48,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:48,980 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:48,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:47:48,982 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:48,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash -676090250, now seen corresponding path program 1 times [2022-11-02 20:47:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:48,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092389328] [2022-11-02 20:47:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:47:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092389328] [2022-11-02 20:47:49,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092389328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:49,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:49,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:47:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250245099] [2022-11-02 20:47:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:49,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:49,426 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:49,758 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-11-02 20:47:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:47:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-02 20:47:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:49,759 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:47:49,759 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 20:47:49,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:47:49,761 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 144 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:49,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 158 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 20:47:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-02 20:47:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-11-02 20:47:49,771 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 41 [2022-11-02 20:47:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:49,772 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-11-02 20:47:49,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-11-02 20:47:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:47:49,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:49,773 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:49,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:47:49,773 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2066036839, now seen corresponding path program 1 times [2022-11-02 20:47:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:49,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366519790] [2022-11-02 20:47:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:47:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:50,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366519790] [2022-11-02 20:47:50,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366519790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:50,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:50,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:47:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675311243] [2022-11-02 20:47:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:50,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:47:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:47:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:47:50,979 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:52,140 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-02 20:47:52,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:47:52,141 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-02 20:47:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:52,141 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:47:52,142 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:47:52,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:47:52,143 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 263 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:52,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 208 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:47:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2022-11-02 20:47:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-11-02 20:47:52,145 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 44 [2022-11-02 20:47:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:52,145 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-11-02 20:47:52,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:47:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-11-02 20:47:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:47:52,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:52,146 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:52,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:47:52,147 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2022-11-02 20:47:52,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash -377366918, now seen corresponding path program 1 times [2022-11-02 20:47:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:52,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686593194] [2022-11-02 20:47:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:47:53,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686593194] [2022-11-02 20:47:53,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686593194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3438419] [2022-11-02 20:47:53,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:53,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:53,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:53,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:53,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b1105d91-db81-4c9e-8b4f-ab6a00ee9fff/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:47:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:53,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-02 20:47:53,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:53,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:47:54,155 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-02 20:47:54,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-02 20:47:54,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:54,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:47:54,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:54,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:47:54,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:54,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:47:54,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:54,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-02 20:47:54,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:54,871 INFO L356 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-11-02 20:47:54,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2022-11-02 20:47:54,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-02 20:47:55,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:55,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2022-11-02 20:47:55,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:47:55,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:47:55,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:55,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:47:55,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:55,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 29 [2022-11-02 20:47:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:47:55,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:55,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 107 [2022-11-02 20:47:57,843 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and (= (select |c_#valid| (select .cse0 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) 1) .cse1 .cse2) (and (or (not .cse1) (not .cse2)) (forall ((v_arrayElimCell_27 Int)) (or (<= (+ v_arrayElimCell_27 1) 0) (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_27))) 1)))) (and .cse1 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse2))) is different from false [2022-11-02 20:47:58,042 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse0 (forall ((v_ArrVal_1632 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (= (select |c_#valid| (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1632))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27))) 1) (<= (+ v_arrayElimCell_27 1) 0)))) (.cse5 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (and (or .cse0 .cse1) (or .cse0 .cse2) (or (forall ((v_ArrVal_1632 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1632))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse5)) 1)) (not .cse2) (not .cse1)) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_ArrVal_1632 (Array Int Int))) (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_#t~mem10#1.base| v_ArrVal_1632))) (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select |c_#valid| (select .cse6 (+ 4 v_arrayElimCell_27))) 1) (= (select |c_#valid| (select .cse6 .cse5)) 1)))) (<= (+ v_arrayElimCell_27 1) 0))))) (and .cse2 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse1))) is different from false [2022-11-02 20:47:58,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse5 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4)) (.cse6 (forall ((v_ArrVal_1632 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (= (select |c_#valid| (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1632))) (store .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27))) 1) (<= (+ v_arrayElimCell_27 1) 0))))) (and (or (forall ((v_ArrVal_1632 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1632))) (store .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)) 1)) (not .cse4) (not .cse5)) (or .cse5 .cse6) (forall ((v_arrayElimCell_27 Int)) (or (<= (+ v_arrayElimCell_27 1) 0) (forall ((v_ArrVal_1632 (Array Int Int))) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1632))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select |c_#valid| (select .cse7 (+ 4 v_arrayElimCell_27))) 1) (= (select |c_#valid| (select .cse7 .cse3)) 1)))))) (or .cse4 .cse6)))) (and .cse4 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse5))) is different from false [2022-11-02 20:47:58,478 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse3 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse3 |c_ULTIMATE.start_dll_prepend_#t~mem8#1.base|)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_1632 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (= (select |c_#valid| (select (let ((.cse11 (let ((.cse12 (store .cse6 .cse7 v_ArrVal_1632))) (store .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27))) 1) (<= (+ v_arrayElimCell_27 1) 0))))) (and (or .cse0 .cse1) (forall ((v_arrayElimCell_27 Int)) (or (<= (+ v_arrayElimCell_27 1) 0) (forall ((v_ArrVal_1632 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1632))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_27))) 1) (= (select |c_#valid| (select .cse2 .cse3)) 1)))))) (or (not .cse0) (forall ((v_ArrVal_1632 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse8 (let ((.cse9 (store .cse6 .cse7 v_ArrVal_1632))) (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)) 1)) (not .cse10)) (or .cse10 .cse1)))))) (and .cse0 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse10))) is different from false [2022-11-02 20:47:58,561 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (let ((.cse6 (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 4))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|) .cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse7 (forall ((v_ArrVal_1632 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (<= (+ v_arrayElimCell_27 1) 0) (= 1 (select |c_#valid| (select (let ((.cse11 (let ((.cse12 (store .cse4 .cse5 v_ArrVal_1632))) (store .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27)))))))) (and (or (not .cse0) (not .cse1) (forall ((v_ArrVal_1632 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse2 (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1632))) (store .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse6)) 1))) (or .cse0 .cse7) (or .cse7 .cse1) (forall ((v_arrayElimCell_27 Int)) (or (forall ((v_ArrVal_1632 (Array Int Int))) (let ((.cse8 (let ((.cse9 (let ((.cse10 (store .cse4 .cse5 v_ArrVal_1632))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= 1 (select |c_#valid| (select .cse8 (+ 4 v_arrayElimCell_27)))) (= (select |c_#valid| (select .cse8 .cse6)) 1)))) (<= (+ v_arrayElimCell_27 1) 0)))))))) (and .cse0 (<= (+ |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset| 1) 0) .cse1))) is different from false [2022-11-02 20:47:58,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (or (and .cse0 .cse1 (<= (+ |c_ULTIMATE.start_node_create_#res#1.offset| 1) 0)) (let ((.cse7 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse2 (forall ((v_ArrVal_1632 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (= (select |c_#valid| (select (let ((.cse11 (let ((.cse12 (store .cse5 .cse6 v_ArrVal_1632))) (store .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27))) 1) (<= (+ v_arrayElimCell_27 1) 0))))) (and (or .cse2 .cse1) (or (forall ((v_ArrVal_1632 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse3 (let ((.cse4 (store .cse5 .cse6 v_ArrVal_1632))) (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse7)) 1)) (not .cse0) (not .cse1)) (forall ((v_arrayElimCell_27 Int)) (or (<= (+ v_arrayElimCell_27 1) 0) (forall ((v_ArrVal_1632 (Array Int Int))) (let ((.cse8 (let ((.cse9 (let ((.cse10 (store .cse5 .cse6 v_ArrVal_1632))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select |c_#valid| (select .cse8 .cse7)) 1) (= (select |c_#valid| (select .cse8 (+ 4 v_arrayElimCell_27))) 1)))))) (or .cse0 .cse2)))))))) is different from false [2022-11-02 20:47:58,760 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (= |c_ULTIMATE.start_dll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and .cse0 .cse1 (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.offset| 1) 0)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset|))) (let ((.cse8 (forall ((v_ArrVal_1632 (Array Int Int)) (v_arrayElimCell_27 Int)) (or (<= (+ v_arrayElimCell_27 1) 0) (= (select |c_#valid| (select (let ((.cse11 (let ((.cse12 (store .cse6 .cse7 v_ArrVal_1632))) (store .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_27))) 1))))) (and (forall ((v_arrayElimCell_27 Int)) (or (<= (+ v_arrayElimCell_27 1) 0) (forall ((v_ArrVal_1632 (Array Int Int))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store .cse6 .cse7 v_ArrVal_1632))) (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select |c_#valid| (select .cse2 .cse3)) 1) (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_27))) 1)))))) (or .cse1 .cse8) (or .cse0 .cse8) (or (forall ((v_ArrVal_1632 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse9 (let ((.cse10 (store .cse6 .cse7 v_ArrVal_1632))) (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.base|) |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)) 1)) (not .cse0) (not .cse1))))))))) is different from false [2022-11-02 20:48:00,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4097 treesize of output 3819 [2022-11-02 20:48:00,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:00,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3939 treesize of output 3669 [2022-11-02 20:48:00,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3749 treesize of output 3617 [2022-11-02 20:48:00,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3706 treesize of output 3538