./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN --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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- 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-6b4ec56 [2022-11-20 10:31:54,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:31:54,911 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:31:54,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:31:54,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:31:54,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:31:54,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:31:54,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:31:54,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:31:54,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:31:54,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:31:54,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:31:54,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:31:54,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:31:54,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:31:54,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:31:54,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:31:54,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:31:54,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:31:54,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:31:54,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:31:54,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:31:54,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:31:54,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:31:54,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:31:54,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:31:54,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:31:54,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:31:54,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:31:54,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:31:54,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:31:54,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:31:54,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:31:54,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:31:54,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:31:54,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:31:54,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:31:54,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:31:54,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:31:54,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:31:54,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:31:54,997 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:31:55,021 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:31:55,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:31:55,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:31:55,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:31:55,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:31:55,023 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:31:55,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:31:55,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:31:55,024 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:31:55,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:31:55,024 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:31:55,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:31:55,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:31:55,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:31:55,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:31:55,025 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:31:55,026 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:31:55,026 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:31:55,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:31:55,026 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:31:55,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:31:55,027 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:31:55,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:31:55,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:31:55,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:31:55,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:55,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:31:55,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:31:55,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:31:55,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:31:55,028 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_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/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_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-20 10:31:55,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:31:55,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:31:55,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:31:55,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:31:55,278 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:31:55,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-20 10:31:58,431 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:31:58,804 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:31:58,805 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-20 10:31:58,822 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/data/7dd550f49/33ae1b126aff4ea1be31d4ade5dfbcc2/FLAG5b037418a [2022-11-20 10:31:58,842 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/data/7dd550f49/33ae1b126aff4ea1be31d4ade5dfbcc2 [2022-11-20 10:31:58,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:31:58,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:31:58,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:58,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:31:58,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:31:58,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:58" (1/1) ... [2022-11-20 10:31:58,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a25f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:58, skipping insertion in model container [2022-11-20 10:31:58,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:31:58" (1/1) ... [2022-11-20 10:31:58,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:31:58,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:31:59,349 WARN L237 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_114c19bc-3ded-47f8-83cc-d0d5f019e207/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-20 10:31:59,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:59,368 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:31:59,421 WARN L237 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_114c19bc-3ded-47f8-83cc-d0d5f019e207/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-20 10:31:59,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:31:59,461 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:31:59,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59 WrapperNode [2022-11-20 10:31:59,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:31:59,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:59,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:31:59,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:31:59,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,522 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2022-11-20 10:31:59,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:31:59,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:31:59,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:31:59,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:31:59,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:31:59,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:31:59,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:31:59,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:31:59,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (1/1) ... [2022-11-20 10:31:59,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:31:59,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:31:59,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:31:59,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-20 10:31:59,670 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-20 10:31:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:31:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:31:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:31:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:31:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:31:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:31:59,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:31:59,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:31:59,881 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:31:59,883 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:32:00,286 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:32:00,293 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:32:00,293 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-20 10:32:00,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:00 BoogieIcfgContainer [2022-11-20 10:32:00,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:32:00,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:32:00,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:32:00,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:32:00,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:31:58" (1/3) ... [2022-11-20 10:32:00,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d844ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:00, skipping insertion in model container [2022-11-20 10:32:00,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:31:59" (2/3) ... [2022-11-20 10:32:00,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d844ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:32:00, skipping insertion in model container [2022-11-20 10:32:00,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:32:00" (3/3) ... [2022-11-20 10:32:00,305 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-20 10:32:00,332 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:32:00,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-20 10:32:00,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:32:00,388 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;@520196d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:32:00,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-11-20 10:32:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:32:00,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:00,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:32:00,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2022-11-20 10:32:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:00,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866356497] [2022-11-20 10:32:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:00,726 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-20 10:32:00,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:00,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866356497] [2022-11-20 10:32:00,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866356497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:00,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:00,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:32:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972675815] [2022-11-20 10:32:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:00,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:32:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:00,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:32:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:32:00,764 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:00,866 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-11-20 10:32:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:32:00,869 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 10:32:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:00,877 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:32:00,878 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 10:32:00,879 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-20 10:32:00,883 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:00,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 10:32:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-20 10:32:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-11-20 10:32:00,924 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2022-11-20 10:32:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:00,925 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-11-20 10:32:00,925 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-11-20 10:32:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:32:00,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:00,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:32:00,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:32:00,927 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2022-11-20 10:32:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:00,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869679865] [2022-11-20 10:32:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:01,111 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-20 10:32:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:01,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869679865] [2022-11-20 10:32:01,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869679865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:01,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:01,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:32:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428155757] [2022-11-20 10:32:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:01,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:32:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:32:01,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:32:01,117 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:01,184 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-11-20 10:32:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:32:01,184 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 10:32:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:01,185 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:32:01,186 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:32:01,186 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-20 10:32:01,187 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:01,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:32:01,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 10:32:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-11-20 10:32:01,196 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2022-11-20 10:32:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:01,197 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-11-20 10:32:01,197 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:32:01,197 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-11-20 10:32:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:32:01,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:01,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:01,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:32:01,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2022-11-20 10:32:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:01,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251368253] [2022-11-20 10:32:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:01,361 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-20 10:32:01,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:01,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251368253] [2022-11-20 10:32:01,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251368253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:01,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:01,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:32:01,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276238788] [2022-11-20 10:32:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:01,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:01,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:01,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:01,364 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:32:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:01,462 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-11-20 10:32:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:32:01,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-20 10:32:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:01,464 INFO L225 Difference]: With dead ends: 95 [2022-11-20 10:32:01,465 INFO L226 Difference]: Without dead ends: 95 [2022-11-20 10:32:01,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:32:01,466 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:01,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-20 10:32:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-11-20 10:32:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-11-20 10:32:01,480 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2022-11-20 10:32:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:01,481 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-11-20 10:32:01,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:32:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-11-20 10:32:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:32:01,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:01,484 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:01,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:32:01,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:01,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:01,485 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2022-11-20 10:32:01,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:01,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474945620] [2022-11-20 10:32:01,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:01,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:01,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:32:01,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:01,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474945620] [2022-11-20 10:32:01,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474945620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:01,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:01,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:32:01,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399757831] [2022-11-20 10:32:01,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:01,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:32:01,878 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:02,124 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-11-20 10:32:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:02,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-20 10:32:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:02,128 INFO L225 Difference]: With dead ends: 105 [2022-11-20 10:32:02,128 INFO L226 Difference]: Without dead ends: 105 [2022-11-20 10:32:02,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:02,130 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:02,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:32:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-20 10:32:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-11-20 10:32:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-11-20 10:32:02,137 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2022-11-20 10:32:02,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:02,138 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-11-20 10:32:02,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-11-20 10:32:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:32:02,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:02,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:02,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:32:02,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:02,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:02,140 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2022-11-20 10:32:02,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:02,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254215832] [2022-11-20 10:32:02,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:02,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:02,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:02,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254215832] [2022-11-20 10:32:02,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254215832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:02,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:02,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:32:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989174735] [2022-11-20 10:32:02,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:02,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:02,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:32:02,495 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:02,698 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-11-20 10:32:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-20 10:32:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:02,700 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:32:02,700 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:32:02,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:02,702 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:02,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:32:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:32:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-20 10:32:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-11-20 10:32:02,708 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2022-11-20 10:32:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:02,709 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-11-20 10:32:02,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-11-20 10:32:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:32:02,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:02,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:02,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:32:02,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2022-11-20 10:32:02,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:02,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599437637] [2022-11-20 10:32:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:03,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599437637] [2022-11-20 10:32:03,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599437637] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:03,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847103669] [2022-11-20 10:32:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:03,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:03,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:03,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:03,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:32:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:03,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:32:03,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:03,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:03,397 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_338 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_338))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 10:32:03,488 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:32:03,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:32:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 10:32:03,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:03,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847103669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:03,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:32:03,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-20 10:32:03,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799242960] [2022-11-20 10:32:03,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:03,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:03,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:03,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:03,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-20 10:32:03,579 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:03,920 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-11-20 10:32:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:03,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-20 10:32:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:03,921 INFO L225 Difference]: With dead ends: 110 [2022-11-20 10:32:03,921 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 10:32:03,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-20 10:32:03,923 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:03,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 372 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2022-11-20 10:32:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 10:32:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2022-11-20 10:32:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-11-20 10:32:03,930 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2022-11-20 10:32:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:03,931 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-11-20 10:32:03,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-11-20 10:32:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:32:03,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:03,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:03,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 10:32:04,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-20 10:32:04,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2022-11-20 10:32:04,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:04,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202371698] [2022-11-20 10:32:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:04,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:04,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:04,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:04,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202371698] [2022-11-20 10:32:04,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202371698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:04,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803216048] [2022-11-20 10:32:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:04,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:04,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:04,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:04,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:32:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:04,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 10:32:04,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:04,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:05,185 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_475 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_475) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-20 10:32:05,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:05,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:32:05,261 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:05,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:32:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 10:32:05,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:07,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803216048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:07,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:32:07,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-11-20 10:32:07,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595318078] [2022-11-20 10:32:07,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:07,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 10:32:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 10:32:07,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2022-11-20 10:32:07,498 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:32:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:08,042 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-11-20 10:32:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:32:08,043 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-20 10:32:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:08,044 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:32:08,044 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 10:32:08,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2022-11-20 10:32:08,045 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:08,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2022-11-20 10:32:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 10:32:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-11-20 10:32:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2022-11-20 10:32:08,050 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2022-11-20 10:32:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:08,051 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2022-11-20 10:32:08,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:32:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-11-20 10:32:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 10:32:08,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:08,053 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] [2022-11-20 10:32:08,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:08,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:08,259 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:08,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2022-11-20 10:32:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:08,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259123423] [2022-11-20 10:32:08,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:08,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:08,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259123423] [2022-11-20 10:32:08,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259123423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:08,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001937614] [2022-11-20 10:32:08,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:08,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:08,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:08,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:08,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:32:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:08,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 10:32:08,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:08,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:08,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001937614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:08,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:08,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-20 10:32:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211578613] [2022-11-20 10:32:08,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:08,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:32:08,795 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:08,933 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-20 10:32:08,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:08,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-20 10:32:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:08,936 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:32:08,937 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 10:32:08,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:08,939 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:08,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 433 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 10:32:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-11-20 10:32:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-11-20 10:32:08,958 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2022-11-20 10:32:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:08,959 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-11-20 10:32:08,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-11-20 10:32:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:32:08,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:08,961 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] [2022-11-20 10:32:08,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:09,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 10:32:09,168 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:09,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2022-11-20 10:32:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:09,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180593191] [2022-11-20 10:32:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:09,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:32:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180593191] [2022-11-20 10:32:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180593191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390019874] [2022-11-20 10:32:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:09,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:09,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:09,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:32:09,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:09,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:32:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:32:09,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:09,500 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-20 10:32:09,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:32:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:32:09,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390019874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:09,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:09,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-20 10:32:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955437448] [2022-11-20 10:32:09,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:09,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:09,527 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:09,686 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-11-20 10:32:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:09,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-20 10:32:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:09,688 INFO L225 Difference]: With dead ends: 113 [2022-11-20 10:32:09,688 INFO L226 Difference]: Without dead ends: 113 [2022-11-20 10:32:09,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:09,689 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:09,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-20 10:32:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2022-11-20 10:32:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-11-20 10:32:09,694 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2022-11-20 10:32:09,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:09,694 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-11-20 10:32:09,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:09,694 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-11-20 10:32:09,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:32:09,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:09,695 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] [2022-11-20 10:32:09,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:09,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:09,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:09,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2022-11-20 10:32:09,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:09,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330993771] [2022-11-20 10:32:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:10,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:10,179 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-20 10:32:10,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:10,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330993771] [2022-11-20 10:32:10,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330993771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:10,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114075269] [2022-11-20 10:32:10,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:10,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:10,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:32:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:10,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 10:32:10,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:10,523 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-20 10:32:10,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:10,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:10,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-20 10:32:10,737 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-20 10:32:10,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114075269] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:10,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:10,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-20 10:32:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339473281] [2022-11-20 10:32:10,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:10,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 10:32:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:10,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 10:32:10,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:32:10,739 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 10:32:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:11,112 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-11-20 10:32:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:32:11,113 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-20 10:32:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:11,114 INFO L225 Difference]: With dead ends: 150 [2022-11-20 10:32:11,114 INFO L226 Difference]: Without dead ends: 150 [2022-11-20 10:32:11,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:32:11,115 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:11,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 748 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:32:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-20 10:32:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-11-20 10:32:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-11-20 10:32:11,119 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2022-11-20 10:32:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:11,120 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-11-20 10:32:11,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 10:32:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-11-20 10:32:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:32:11,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:11,121 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] [2022-11-20 10:32:11,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:11,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:11,322 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:11,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:11,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2022-11-20 10:32:11,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:11,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475450613] [2022-11-20 10:32:11,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:11,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:11,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:11,483 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-20 10:32:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475450613] [2022-11-20 10:32:11,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475450613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:11,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:11,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:32:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347148329] [2022-11-20 10:32:11,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:11,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:32:11,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:32:11,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:11,485 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:11,708 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-11-20 10:32:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:32:11,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-20 10:32:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:11,710 INFO L225 Difference]: With dead ends: 111 [2022-11-20 10:32:11,710 INFO L226 Difference]: Without dead ends: 111 [2022-11-20 10:32:11,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:32:11,711 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 136 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:11,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 294 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:32:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-20 10:32:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-11-20 10:32:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-11-20 10:32:11,714 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2022-11-20 10:32:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:11,714 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-11-20 10:32:11,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-11-20 10:32:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:32:11,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:11,716 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] [2022-11-20 10:32:11,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:32:11,716 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2022-11-20 10:32:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:11,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396325542] [2022-11-20 10:32:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,113 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-20 10:32:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:12,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396325542] [2022-11-20 10:32:12,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396325542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:12,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:12,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:32:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646062152] [2022-11-20 10:32:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:12,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:32:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:12,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:32:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:12,116 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:12,334 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-11-20 10:32:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:32:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-20 10:32:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:12,336 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:32:12,336 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 10:32:12,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:32:12,337 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 136 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:12,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 290 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:32:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 10:32:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-20 10:32:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2022-11-20 10:32:12,340 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2022-11-20 10:32:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:12,340 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2022-11-20 10:32:12,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2022-11-20 10:32:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:32:12,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:12,341 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] [2022-11-20 10:32:12,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:32:12,342 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:12,342 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2022-11-20 10:32:12,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:12,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544476068] [2022-11-20 10:32:12,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:12,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,483 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-20 10:32:12,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:12,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544476068] [2022-11-20 10:32:12,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544476068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:12,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:12,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:32:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290390712] [2022-11-20 10:32:12,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:12,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:12,485 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:12,616 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-20 10:32:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:12,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-20 10:32:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:12,618 INFO L225 Difference]: With dead ends: 116 [2022-11-20 10:32:12,618 INFO L226 Difference]: Without dead ends: 116 [2022-11-20 10:32:12,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:32:12,619 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 127 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:12,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 281 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-20 10:32:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2022-11-20 10:32:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.5) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-20 10:32:12,622 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 35 [2022-11-20 10:32:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:12,622 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-20 10:32:12,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-20 10:32:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:32:12,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:12,626 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] [2022-11-20 10:32:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:32:12,627 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash 452746622, now seen corresponding path program 1 times [2022-11-20 10:32:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:12,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81485461] [2022-11-20 10:32:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:12,869 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-20 10:32:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:12,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81485461] [2022-11-20 10:32:12,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81485461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:12,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:12,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:32:12,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064664851] [2022-11-20 10:32:12,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:12,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:12,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:12,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:12,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:12,871 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:13,208 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2022-11-20 10:32:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:32:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-20 10:32:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:13,210 INFO L225 Difference]: With dead ends: 118 [2022-11-20 10:32:13,210 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 10:32:13,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:32:13,211 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 308 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:13,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 349 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:32:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 10:32:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2022-11-20 10:32:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-20 10:32:13,214 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 35 [2022-11-20 10:32:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:13,214 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-20 10:32:13,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-20 10:32:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:32:13,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:13,215 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] [2022-11-20 10:32:13,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:32:13,215 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash 452746623, now seen corresponding path program 1 times [2022-11-20 10:32:13,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:13,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808816051] [2022-11-20 10:32:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:13,614 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-20 10:32:13,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:13,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808816051] [2022-11-20 10:32:13,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808816051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:13,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:13,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:32:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406327988] [2022-11-20 10:32:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:13,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:13,617 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:14,046 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-11-20 10:32:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:32:14,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-20 10:32:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:14,047 INFO L225 Difference]: With dead ends: 142 [2022-11-20 10:32:14,047 INFO L226 Difference]: Without dead ends: 142 [2022-11-20 10:32:14,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:32:14,048 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 315 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:14,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 530 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:32:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-20 10:32:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2022-11-20 10:32:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2022-11-20 10:32:14,051 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 35 [2022-11-20 10:32:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:14,052 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2022-11-20 10:32:14,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-11-20 10:32:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 10:32:14,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:14,052 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] [2022-11-20 10:32:14,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:32:14,053 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:14,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2022-11-20 10:32:14,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:14,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138990914] [2022-11-20 10:32:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:14,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138990914] [2022-11-20 10:32:14,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138990914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:14,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391265023] [2022-11-20 10:32:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:14,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:14,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:14,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:32:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:15,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 10:32:15,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:15,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:15,295 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:15,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:32:15,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:32:15,433 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:15,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 10:32:15,515 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:15,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 10:32:15,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:32:15,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:32:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:32:15,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:15,771 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-20 10:32:15,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 10:32:15,846 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1578 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_ArrVal_1578 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-11-20 10:32:15,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:15,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-20 10:32:15,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-11-20 10:32:15,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 10:32:15,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:15,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-20 10:32:15,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:15,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-20 10:32:15,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391265023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:16,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:32:16,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2022-11-20 10:32:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099442091] [2022-11-20 10:32:16,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:16,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-20 10:32:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-20 10:32:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=978, Unknown=1, NotChecked=62, Total=1122 [2022-11-20 10:32:16,009 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:17,323 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-11-20 10:32:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:32:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-11-20 10:32:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:17,325 INFO L225 Difference]: With dead ends: 136 [2022-11-20 10:32:17,325 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 10:32:17,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=1608, Unknown=1, NotChecked=82, Total=1892 [2022-11-20 10:32:17,327 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 221 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:17,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1051 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:32:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 10:32:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-11-20 10:32:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-20 10:32:17,333 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 38 [2022-11-20 10:32:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:17,334 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-20 10:32:17,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-20 10:32:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 10:32:17,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:17,335 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] [2022-11-20 10:32:17,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:17,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:32:17,542 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:17,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337164, now seen corresponding path program 1 times [2022-11-20 10:32:17,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:17,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765296347] [2022-11-20 10:32:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:18,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:19,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765296347] [2022-11-20 10:32:19,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765296347] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:19,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874098891] [2022-11-20 10:32:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:19,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:19,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:32:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:19,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-20 10:32:19,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:19,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:19,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:19,777 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:32:19,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-20 10:32:19,815 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:19,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:32:19,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:32:19,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:32:20,122 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:20,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2022-11-20 10:32:20,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:32:20,352 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:20,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 10:32:20,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:32:20,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:32:20,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:20,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 10:32:20,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:32:20,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:32:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:32:20,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:21,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:21,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-11-20 10:32:21,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:21,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-20 10:32:21,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2022-11-20 10:32:21,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 314 [2022-11-20 10:32:21,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 150 [2022-11-20 10:32:21,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 286 [2022-11-20 10:32:21,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 270 [2022-11-20 10:32:21,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 262 [2022-11-20 10:32:21,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:21,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-20 10:32:21,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:21,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:21,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-20 10:32:30,416 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:32:30,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874098891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:30,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:32:30,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2022-11-20 10:32:30,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491314782] [2022-11-20 10:32:30,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:30,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 10:32:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:30,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 10:32:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2508, Unknown=2, NotChecked=0, Total=2652 [2022-11-20 10:32:30,420 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:32:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:33,652 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2022-11-20 10:32:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:32:33,652 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-11-20 10:32:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:33,654 INFO L225 Difference]: With dead ends: 216 [2022-11-20 10:32:33,654 INFO L226 Difference]: Without dead ends: 216 [2022-11-20 10:32:33,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=351, Invalid=3937, Unknown=2, NotChecked=0, Total=4290 [2022-11-20 10:32:33,656 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1258 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:33,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 2651 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1852 Invalid, 0 Unknown, 166 Unchecked, 1.4s Time] [2022-11-20 10:32:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-20 10:32:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 113. [2022-11-20 10:32:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 108 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:32:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-11-20 10:32:33,662 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 38 [2022-11-20 10:32:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:33,662 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-11-20 10:32:33,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:32:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-11-20 10:32:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:32:33,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:33,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:33,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 10:32:33,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:32:33,870 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2022-11-20 10:32:33,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:33,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826371397] [2022-11-20 10:32:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:33,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:33,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-20 10:32:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:32:34,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:34,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826371397] [2022-11-20 10:32:34,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826371397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:34,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241506766] [2022-11-20 10:32:34,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:34,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:34,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:34,013 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:34,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:32:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:32:34,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:34,311 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:32:34,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:32:34,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241506766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:34,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:32:34,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 10:32:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821023434] [2022-11-20 10:32:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:34,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:32:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:32:34,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:34,313 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:34,325 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-11-20 10:32:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:32:34,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-20 10:32:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:34,326 INFO L225 Difference]: With dead ends: 96 [2022-11-20 10:32:34,327 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:32:34,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:34,327 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 63 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:34,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:32:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:32:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-20 10:32:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 92 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2022-11-20 10:32:34,332 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 41 [2022-11-20 10:32:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:34,332 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2022-11-20 10:32:34,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-20 10:32:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-11-20 10:32:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:32:34,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:34,335 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:34,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:34,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:32:34,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash -784093497, now seen corresponding path program 2 times [2022-11-20 10:32:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:34,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444730858] [2022-11-20 10:32:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 10:32:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:34,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444730858] [2022-11-20 10:32:34,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444730858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:34,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:34,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:32:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921997461] [2022-11-20 10:32:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:34,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:32:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:32:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:32:34,715 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:34,840 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2022-11-20 10:32:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:32:34,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-20 10:32:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:34,842 INFO L225 Difference]: With dead ends: 113 [2022-11-20 10:32:34,842 INFO L226 Difference]: Without dead ends: 113 [2022-11-20 10:32:34,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:34,843 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 247 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:34,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 221 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-20 10:32:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2022-11-20 10:32:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 92 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-11-20 10:32:34,846 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 41 [2022-11-20 10:32:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:34,846 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-11-20 10:32:34,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-11-20 10:32:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 10:32:34,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:34,847 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-20 10:32:34,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:32:34,847 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:34,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584715, now seen corresponding path program 1 times [2022-11-20 10:32:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:34,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604542283] [2022-11-20 10:32:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:34,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:32:34,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:34,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604542283] [2022-11-20 10:32:34,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604542283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:34,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795825673] [2022-11-20 10:32:34,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:34,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:34,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:34,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:35,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:32:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 10:32:35,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:32:35,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:32:35,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795825673] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:35,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:35,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-20 10:32:35,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459137092] [2022-11-20 10:32:35,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:35,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:32:35,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:32:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:35,358 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:32:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:35,454 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-11-20 10:32:35,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:32:35,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-11-20 10:32:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:35,456 INFO L225 Difference]: With dead ends: 115 [2022-11-20 10:32:35,456 INFO L226 Difference]: Without dead ends: 115 [2022-11-20 10:32:35,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:32:35,457 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 248 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:35,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 200 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-20 10:32:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2022-11-20 10:32:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.430232558139535) internal successors, (123), 105 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2022-11-20 10:32:35,460 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 45 [2022-11-20 10:32:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:35,461 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2022-11-20 10:32:35,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:32:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-11-20 10:32:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-20 10:32:35,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:35,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:35,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:35,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:35,668 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1454244195, now seen corresponding path program 1 times [2022-11-20 10:32:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:35,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241273135] [2022-11-20 10:32:35,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:32:35,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:35,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241273135] [2022-11-20 10:32:35,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241273135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:35,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673863086] [2022-11-20 10:32:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:35,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:35,828 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:35,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:32:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:36,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:32:36,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:32:36,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:32:36,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673863086] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:32:36,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:32:36,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-11-20 10:32:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359630337] [2022-11-20 10:32:36,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:36,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:32:36,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:36,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:32:36,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:32:36,237 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:32:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:36,363 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-11-20 10:32:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-11-20 10:32:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:36,364 INFO L225 Difference]: With dead ends: 96 [2022-11-20 10:32:36,365 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 10:32:36,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:32:36,366 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 343 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:36,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 253 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 10:32:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-20 10:32:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 86 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-11-20 10:32:36,369 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 46 [2022-11-20 10:32:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:36,383 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-11-20 10:32:36,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:32:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-11-20 10:32:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:32:36,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:36,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:36,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:36,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:36,584 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:36,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -748626799, now seen corresponding path program 2 times [2022-11-20 10:32:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:36,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969181672] [2022-11-20 10:32:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:36,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:36,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:32:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:36,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969181672] [2022-11-20 10:32:36,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969181672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:36,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:36,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:32:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508063465] [2022-11-20 10:32:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:36,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:36,826 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:37,116 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2022-11-20 10:32:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:32:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-11-20 10:32:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:37,118 INFO L225 Difference]: With dead ends: 118 [2022-11-20 10:32:37,118 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 10:32:37,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:32:37,118 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 271 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:37,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 307 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:32:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 10:32:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2022-11-20 10:32:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2022-11-20 10:32:37,122 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 50 [2022-11-20 10:32:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:37,122 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2022-11-20 10:32:37,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2022-11-20 10:32:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:32:37,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:37,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:37,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 10:32:37,123 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -748626798, now seen corresponding path program 1 times [2022-11-20 10:32:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:37,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798068203] [2022-11-20 10:32:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:32:37,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:37,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798068203] [2022-11-20 10:32:37,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798068203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:37,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:37,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:32:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094658611] [2022-11-20 10:32:37,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:37,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:32:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:37,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:32:37,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:32:37,265 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:37,366 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-11-20 10:32:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:32:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-11-20 10:32:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:37,368 INFO L225 Difference]: With dead ends: 101 [2022-11-20 10:32:37,368 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 10:32:37,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:32:37,369 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 92 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:37,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 239 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:32:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 10:32:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-11-20 10:32:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2022-11-20 10:32:37,372 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 50 [2022-11-20 10:32:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:37,372 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2022-11-20 10:32:37,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-11-20 10:32:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 10:32:37,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:37,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:37,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 10:32:37,374 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:37,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -748626743, now seen corresponding path program 1 times [2022-11-20 10:32:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:37,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365764957] [2022-11-20 10:32:37,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:32:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:37,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365764957] [2022-11-20 10:32:37,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365764957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:32:37,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:32:37,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:32:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676641226] [2022-11-20 10:32:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:32:37,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:32:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:32:37,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:32:37,868 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:38,175 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2022-11-20 10:32:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:32:38,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-11-20 10:32:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:38,176 INFO L225 Difference]: With dead ends: 130 [2022-11-20 10:32:38,176 INFO L226 Difference]: Without dead ends: 130 [2022-11-20 10:32:38,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:32:38,177 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 378 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:38,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 337 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:32:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-20 10:32:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2022-11-20 10:32:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 91 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-11-20 10:32:38,180 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 50 [2022-11-20 10:32:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:38,181 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-11-20 10:32:38,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:32:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-11-20 10:32:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 10:32:38,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:38,181 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 10:32:38,182 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:38,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902980, now seen corresponding path program 1 times [2022-11-20 10:32:38,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:38,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043645439] [2022-11-20 10:32:38,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:38,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:39,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043645439] [2022-11-20 10:32:39,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043645439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:39,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700012066] [2022-11-20 10:32:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:39,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:39,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:39,629 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:39,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:32:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:39,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-20 10:32:39,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:39,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:40,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:40,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:32:40,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:32:40,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:40,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 10:32:40,233 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:40,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 10:32:40,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:40,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:32:40,507 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:40,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 10:32:40,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:40,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:32:40,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:32:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:32:40,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:41,702 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_2995) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-20 10:32:42,292 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-11-20 10:32:42,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-11-20 10:32:42,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2992 (Array Int Int)) (v_ArrVal_2994 Int)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2992))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2994)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2995))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-11-20 10:32:42,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2992 (Array Int Int)) (v_ArrVal_2994 Int) (v_ArrVal_2991 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2991) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2992))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2994)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2995))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-20 10:32:42,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:42,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 51 [2022-11-20 10:32:42,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 254 [2022-11-20 10:32:42,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 226 [2022-11-20 10:32:42,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 107 [2022-11-20 10:32:42,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 198 [2022-11-20 10:32:42,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700012066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:42,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:32:42,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 33 [2022-11-20 10:32:42,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967256178] [2022-11-20 10:32:42,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:42,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 10:32:42,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:42,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 10:32:42,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1736, Unknown=96, NotChecked=264, Total=2256 [2022-11-20 10:32:42,730 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:32:44,058 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2022-11-20 10:32:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:32:44,059 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-20 10:32:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:32:44,060 INFO L225 Difference]: With dead ends: 158 [2022-11-20 10:32:44,060 INFO L226 Difference]: Without dead ends: 158 [2022-11-20 10:32:44,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=355, Invalid=2864, Unknown=99, NotChecked=342, Total=3660 [2022-11-20 10:32:44,062 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 327 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:32:44,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1064 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:32:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-20 10:32:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-11-20 10:32:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 99 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-11-20 10:32:44,067 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 53 [2022-11-20 10:32:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:32:44,067 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-11-20 10:32:44,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:32:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-11-20 10:32:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 10:32:44,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:32:44,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:32:44,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:32:44,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 10:32:44,275 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:32:44,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:32:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902981, now seen corresponding path program 1 times [2022-11-20 10:32:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:32:44,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961757273] [2022-11-20 10:32:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:32:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:32:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:32:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:32:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:32:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961757273] [2022-11-20 10:32:46,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961757273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625033295] [2022-11-20 10:32:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:32:46,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:32:46,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:32:46,376 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:32:46,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:32:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:32:46,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-20 10:32:46,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:32:46,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:46,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:32:47,181 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:32:47,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:32:47,193 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) is different from false [2022-11-20 10:32:47,195 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) is different from true [2022-11-20 10:32:47,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:32:47,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:32:47,430 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:47,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2022-11-20 10:32:47,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:32:47,629 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:47,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 10:32:47,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:32:47,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:47,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 10:32:47,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:47,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:32:47,999 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:32:47,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-20 10:32:48,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:32:48,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:48,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 10:32:48,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:32:48,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:32:48,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:32:48,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:32:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 10:32:48,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:32:49,009 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2022-11-20 10:32:49,030 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2022-11-20 10:32:49,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-11-20 10:32:49,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-11-20 10:32:49,074 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3206) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8))))) is different from false [2022-11-20 10:32:49,262 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3203 Int) (v_ArrVal_3205 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_3203)) .cse2 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_3203 Int) (v_ArrVal_3204 Int) (v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_3203)) .cse2 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_3204)) .cse2 v_ArrVal_3206) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2022-11-20 10:32:50,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:50,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2022-11-20 10:32:50,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 562 treesize of output 550 [2022-11-20 10:32:50,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:50,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 546 treesize of output 426 [2022-11-20 10:32:50,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1066 treesize of output 998 [2022-11-20 10:32:50,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 994 treesize of output 962 [2022-11-20 10:32:50,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 962 treesize of output 898 [2022-11-20 10:32:50,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 898 treesize of output 882 [2022-11-20 10:32:50,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 882 treesize of output 874 [2022-11-20 10:32:50,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 874 treesize of output 870 [2022-11-20 10:32:50,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:50,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2022-11-20 10:32:50,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:50,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:50,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 192 [2022-11-20 10:32:50,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:32:50,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 132 [2022-11-20 10:32:50,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:50,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:32:50,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 70 [2022-11-20 10:32:50,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-20 10:32:50,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-20 10:32:59,437 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:32:59,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625033295] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:32:59,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:32:59,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 40 [2022-11-20 10:32:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115717751] [2022-11-20 10:32:59,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:32:59,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 10:32:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:32:59,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 10:32:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2455, Unknown=28, NotChecked=742, Total=3422 [2022-11-20 10:32:59,441 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 41 states, 40 states have (on average 2.05) internal successors, (82), 36 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:32:59,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) .cse0 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse1 (select |c_#length| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-11-20 10:32:59,829 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) .cse0 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse1 (select |c_#length| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from true [2022-11-20 10:33:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:01,857 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2022-11-20 10:33:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:33:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 36 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2022-11-20 10:33:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:01,859 INFO L225 Difference]: With dead ends: 176 [2022-11-20 10:33:01,859 INFO L226 Difference]: Without dead ends: 176 [2022-11-20 10:33:01,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=412, Invalid=3880, Unknown=30, NotChecked=1080, Total=5402 [2022-11-20 10:33:01,861 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 644 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:01,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1220 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 983 Invalid, 0 Unknown, 105 Unchecked, 0.9s Time] [2022-11-20 10:33:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-20 10:33:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2022-11-20 10:33:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2022-11-20 10:33:01,865 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 53 [2022-11-20 10:33:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:01,866 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2022-11-20 10:33:01,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 36 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:33:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2022-11-20 10:33:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 10:33:01,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:01,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:01,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:02,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:02,067 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1850823601, now seen corresponding path program 2 times [2022-11-20 10:33:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:02,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928224191] [2022-11-20 10:33:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:02,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:02,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-20 10:33:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:02,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928224191] [2022-11-20 10:33:02,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928224191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:02,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:02,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:33:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919052749] [2022-11-20 10:33:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:02,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:33:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:33:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:33:02,228 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:02,336 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-11-20 10:33:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:33:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-11-20 10:33:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:02,337 INFO L225 Difference]: With dead ends: 88 [2022-11-20 10:33:02,337 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 10:33:02,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:33:02,338 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 163 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:02,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 150 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:33:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 10:33:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-20 10:33:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 84 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:02,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-20 10:33:02,341 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 56 [2022-11-20 10:33:02,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:02,341 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-20 10:33:02,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-20 10:33:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:33:02,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:02,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:02,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 10:33:02,342 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1490386454, now seen corresponding path program 1 times [2022-11-20 10:33:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:02,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107980615] [2022-11-20 10:33:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:33:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:05,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107980615] [2022-11-20 10:33:05,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107980615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:05,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125923181] [2022-11-20 10:33:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:05,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:05,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:05,024 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:05,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:33:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:05,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-20 10:33:05,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:05,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:33:05,660 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:33:05,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:33:05,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:33:05,896 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:05,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 10:33:06,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:06,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-20 10:33:06,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-20 10:33:06,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:33:06,830 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:06,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-11-20 10:33:06,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-20 10:33:06,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:06,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-20 10:33:07,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:07,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:07,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-20 10:33:07,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 10:33:07,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:07,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-11-20 10:33:07,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2022-11-20 10:33:07,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-20 10:33:07,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 10:33:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:33:07,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:08,272 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_3537 Int) (v_ArrVal_3535 Int) (v_ArrVal_3538 (Array Int Int))) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3538) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_3537)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_3535)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) 1))) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3535 Int) (v_ArrVal_3538 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3538) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_3537)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_3535)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) 1) .cse0)))) is different from false [2022-11-20 10:33:08,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:08,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-20 10:33:08,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:08,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-20 10:33:08,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-20 10:33:08,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:08,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-20 10:33:08,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:08,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-20 10:33:08,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-20 10:33:08,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3532) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)))))) is different from false [2022-11-20 10:33:11,439 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3532) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse1 .cse2) (<= .cse2 .cse1))) is different from false [2022-11-20 10:33:11,530 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3532) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-11-20 10:33:11,566 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3533) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3533) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse0)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3532) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) is different from false [2022-11-20 10:33:12,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:33:12,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-11-20 10:33:12,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:33:12,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-20 10:33:12,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3526 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3526) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2022-11-20 10:33:12,217 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3526 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3526) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-20 10:33:12,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:12,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-20 10:33:12,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2022-11-20 10:33:12,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 10:33:12,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 10:33:12,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-20 10:33:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-20 10:33:13,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125923181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:13,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:13,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 31] total 83 [2022-11-20 10:33:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131794581] [2022-11-20 10:33:13,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:13,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-20 10:33:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-20 10:33:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=5353, Unknown=94, NotChecked=1078, Total=6806 [2022-11-20 10:33:13,213 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 83 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 74 states have internal predecessors, (141), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 10:33:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:20,015 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-11-20 10:33:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 10:33:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 74 states have internal predecessors, (141), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-11-20 10:33:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:20,016 INFO L225 Difference]: With dead ends: 88 [2022-11-20 10:33:20,017 INFO L226 Difference]: Without dead ends: 88 [2022-11-20 10:33:20,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 101 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 2911 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=469, Invalid=8575, Unknown=104, NotChecked=1358, Total=10506 [2022-11-20 10:33:20,020 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 62 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:20,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1686 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 875 Invalid, 0 Unknown, 416 Unchecked, 0.8s Time] [2022-11-20 10:33:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-20 10:33:20,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-20 10:33:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:20,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-20 10:33:20,023 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 57 [2022-11-20 10:33:20,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:20,023 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-20 10:33:20,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 74 states have internal predecessors, (141), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-20 10:33:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-20 10:33:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 10:33:20,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:20,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:20,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:20,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 10:33:20,232 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1792642665, now seen corresponding path program 1 times [2022-11-20 10:33:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:20,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608622409] [2022-11-20 10:33:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:21,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 10:33:21,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:21,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608622409] [2022-11-20 10:33:21,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608622409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:21,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225786321] [2022-11-20 10:33:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:21,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:21,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:21,420 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:21,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 10:33:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:21,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-20 10:33:21,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:22,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-20 10:33:22,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 10:33:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:33:22,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:22,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-20 10:33:22,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:22,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-20 10:33:22,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225786321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:22,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:22,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 38 [2022-11-20 10:33:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269651202] [2022-11-20 10:33:22,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:22,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 10:33:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 10:33:22,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2022-11-20 10:33:22,877 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:33:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:24,268 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-11-20 10:33:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:33:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-11-20 10:33:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:24,281 INFO L225 Difference]: With dead ends: 122 [2022-11-20 10:33:24,281 INFO L226 Difference]: Without dead ends: 122 [2022-11-20 10:33:24,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=395, Invalid=2257, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 10:33:24,283 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 1085 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:24,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 950 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 10:33:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-20 10:33:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2022-11-20 10:33:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 88 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-20 10:33:24,286 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 64 [2022-11-20 10:33:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:24,286 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-20 10:33:24,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:33:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-20 10:33:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-20 10:33:24,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:24,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:24,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:24,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 10:33:24,495 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:24,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:24,495 INFO L85 PathProgramCache]: Analyzing trace with hash 3674256, now seen corresponding path program 2 times [2022-11-20 10:33:24,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:24,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200339316] [2022-11-20 10:33:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:24,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:33:24,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:24,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200339316] [2022-11-20 10:33:24,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200339316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:24,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694187722] [2022-11-20 10:33:24,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:33:24,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:24,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:24,667 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:24,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 10:33:25,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:33:25,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:33:25,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:33:25,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:33:25,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:33:25,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694187722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:25,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:25,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-11-20 10:33:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367855040] [2022-11-20 10:33:25,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:25,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:33:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:33:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:33:25,325 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:33:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:25,468 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-20 10:33:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:33:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2022-11-20 10:33:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:25,469 INFO L225 Difference]: With dead ends: 83 [2022-11-20 10:33:25,469 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 10:33:25,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:33:25,470 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 90 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:25,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 268 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:33:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 10:33:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-20 10:33:25,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-11-20 10:33:25,473 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2022-11-20 10:33:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:25,473 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-11-20 10:33:25,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:33:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-11-20 10:33:25,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 10:33:25,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:25,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:25,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-20 10:33:25,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:25,682 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 775968223, now seen corresponding path program 1 times [2022-11-20 10:33:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:25,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571291396] [2022-11-20 10:33:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:25,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:25,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-20 10:33:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:25,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571291396] [2022-11-20 10:33:25,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571291396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:25,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:25,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:33:25,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20720828] [2022-11-20 10:33:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:25,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:33:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:25,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:33:25,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:33:25,831 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:25,977 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-11-20 10:33:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:33:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-11-20 10:33:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:25,978 INFO L225 Difference]: With dead ends: 101 [2022-11-20 10:33:25,978 INFO L226 Difference]: Without dead ends: 101 [2022-11-20 10:33:25,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:33:25,979 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 101 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:25,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 220 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:33:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-20 10:33:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2022-11-20 10:33:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-20 10:33:25,982 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 68 [2022-11-20 10:33:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:25,982 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-20 10:33:25,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-20 10:33:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 10:33:25,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:25,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:25,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 10:33:25,983 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash 775968224, now seen corresponding path program 1 times [2022-11-20 10:33:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:25,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238660025] [2022-11-20 10:33:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:26,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 10:33:26,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:26,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238660025] [2022-11-20 10:33:26,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238660025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:26,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:26,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:33:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636855554] [2022-11-20 10:33:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:26,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:33:26,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:33:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:33:26,456 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:26,825 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-20 10:33:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:33:26,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-11-20 10:33:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:26,826 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:33:26,826 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:33:26,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:33:26,827 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 192 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:26,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 209 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:33:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:33:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 10:33:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.178082191780822) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-20 10:33:26,830 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 68 [2022-11-20 10:33:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:26,831 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-20 10:33:26,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-20 10:33:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 10:33:26,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:26,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:26,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-20 10:33:26,832 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1714754975, now seen corresponding path program 1 times [2022-11-20 10:33:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:26,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790228291] [2022-11-20 10:33:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 10:33:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:27,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790228291] [2022-11-20 10:33:27,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790228291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:27,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:27,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:33:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825560741] [2022-11-20 10:33:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:27,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:33:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:27,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:33:27,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:33:27,148 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:27,434 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-20 10:33:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:33:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2022-11-20 10:33:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:27,435 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:33:27,435 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:33:27,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:33:27,436 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 188 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:27,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 265 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:33:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:33:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-20 10:33:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-20 10:33:27,442 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 69 [2022-11-20 10:33:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:27,442 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-20 10:33:27,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-20 10:33:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 10:33:27,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:27,445 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:27,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 10:33:27,446 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436959, now seen corresponding path program 1 times [2022-11-20 10:33:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:27,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711140401] [2022-11-20 10:33:27,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:27,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:27,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:27,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 10:33:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:27,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711140401] [2022-11-20 10:33:27,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711140401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:27,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398883444] [2022-11-20 10:33:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:27,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:27,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:27,787 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:27,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 10:33:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:28,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-20 10:33:28,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:28,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:33:28,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 10:33:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:33:28,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:28,820 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-20 10:33:28,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-20 10:33:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 10:33:28,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398883444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:28,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:28,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 8] total 27 [2022-11-20 10:33:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31459337] [2022-11-20 10:33:28,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:28,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 10:33:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:28,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 10:33:28,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-11-20 10:33:28,994 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 28 states, 27 states have (on average 4.296296296296297) internal successors, (116), 26 states have internal predecessors, (116), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:33:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:29,868 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-11-20 10:33:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:33:29,868 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.296296296296297) internal successors, (116), 26 states have internal predecessors, (116), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-11-20 10:33:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:29,878 INFO L225 Difference]: With dead ends: 92 [2022-11-20 10:33:29,878 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 10:33:29,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 10:33:29,879 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 485 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:29,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 607 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:33:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 10:33:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-11-20 10:33:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.162162162162162) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-20 10:33:29,882 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 71 [2022-11-20 10:33:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:29,883 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-20 10:33:29,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.296296296296297) internal successors, (116), 26 states have internal predecessors, (116), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 10:33:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-20 10:33:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-20 10:33:29,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:29,884 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:29,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:30,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:30,092 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436960, now seen corresponding path program 1 times [2022-11-20 10:33:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:30,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100659032] [2022-11-20 10:33:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:31,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:31,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:33:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:32,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100659032] [2022-11-20 10:33:32,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100659032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:32,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841260369] [2022-11-20 10:33:32,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:32,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:32,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:32,142 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:32,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 10:33:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:32,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-20 10:33:32,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:32,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:33:32,857 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:33:32,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:33:33,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:33:33,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:33:33,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:33,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 10:33:33,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:33:33,368 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:33:33,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 10:33:33,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:33:33,394 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:33,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-20 10:33:33,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 10:33:33,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-20 10:33:33,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-11-20 10:33:34,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 10:33:34,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:34,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:34,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:34,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 10:33:34,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-20 10:33:34,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:34,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2022-11-20 10:33:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 10:33:35,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:35,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:35,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-20 10:33:35,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:35,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-11-20 10:33:37,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:37,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2022-11-20 10:33:37,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 256 [2022-11-20 10:33:37,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:37,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 196 [2022-11-20 10:33:37,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 516 treesize of output 480 [2022-11-20 10:33:37,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 476 treesize of output 460 [2022-11-20 10:33:37,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 428 [2022-11-20 10:33:37,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 428 treesize of output 420 [2022-11-20 10:33:37,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 416 [2022-11-20 10:33:37,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 206 [2022-11-20 10:33:38,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841260369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:38,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:33:38,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 54 [2022-11-20 10:33:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573418326] [2022-11-20 10:33:38,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:38,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-20 10:33:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-20 10:33:38,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=5554, Unknown=14, NotChecked=0, Total=5852 [2022-11-20 10:33:38,207 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:33:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:42,446 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-11-20 10:33:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 10:33:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-11-20 10:33:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:42,448 INFO L225 Difference]: With dead ends: 93 [2022-11-20 10:33:42,448 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 10:33:42,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=729, Invalid=9157, Unknown=14, NotChecked=0, Total=9900 [2022-11-20 10:33:42,450 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 710 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:42,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1022 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 10:33:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 10:33:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2022-11-20 10:33:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.144736842105263) internal successors, (87), 82 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-20 10:33:42,453 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 71 [2022-11-20 10:33:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:42,454 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-20 10:33:42,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:33:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-20 10:33:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 10:33:42,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:42,455 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:42,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:42,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:42,663 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash -931128602, now seen corresponding path program 1 times [2022-11-20 10:33:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:42,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924766076] [2022-11-20 10:33:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 10:33:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:42,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924766076] [2022-11-20 10:33:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924766076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:33:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526476560] [2022-11-20 10:33:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:42,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:33:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:33:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:33:42,905 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:43,150 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-20 10:33:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:33:43,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2022-11-20 10:33:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:43,152 INFO L225 Difference]: With dead ends: 85 [2022-11-20 10:33:43,152 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 10:33:43,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:33:43,152 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 173 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:43,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 230 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:33:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 10:33:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-20 10:33:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.118421052631579) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-20 10:33:43,155 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 72 [2022-11-20 10:33:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:43,156 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-20 10:33:43,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-20 10:33:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-20 10:33:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 10:33:43,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:43,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:43,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-20 10:33:43,157 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1459966101, now seen corresponding path program 1 times [2022-11-20 10:33:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:43,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357053261] [2022-11-20 10:33:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:33:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357053261] [2022-11-20 10:33:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357053261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160154996] [2022-11-20 10:33:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:44,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:44,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:44,728 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:44,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 10:33:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:45,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 10:33:45,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:45,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:33:45,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:33:45,379 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:33:45,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:33:45,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:33:45,614 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:45,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-11-20 10:33:45,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:45,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 10:33:45,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:45,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:33:46,151 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:46,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-20 10:33:46,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:33:46,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-20 10:33:46,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-20 10:33:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 10:33:46,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:46,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4990 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4990) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-20 10:33:47,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4990 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_4990) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-20 10:33:47,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4990 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_4990) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-20 10:33:47,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:47,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 53 [2022-11-20 10:33:47,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 140 [2022-11-20 10:33:47,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 128 [2022-11-20 10:33:47,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-11-20 10:33:47,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-11-20 10:33:48,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160154996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:48,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:33:48,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 39 [2022-11-20 10:33:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173153160] [2022-11-20 10:33:48,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:48,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 10:33:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 10:33:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2424, Unknown=47, NotChecked=306, Total=2970 [2022-11-20 10:33:48,028 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:33:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:49,851 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-20 10:33:49,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 10:33:49,851 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 74 [2022-11-20 10:33:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:49,852 INFO L225 Difference]: With dead ends: 90 [2022-11-20 10:33:49,852 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 10:33:49,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=398, Invalid=3727, Unknown=47, NotChecked=384, Total=4556 [2022-11-20 10:33:49,854 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 305 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:49,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 593 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:33:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 10:33:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-11-20 10:33:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-20 10:33:49,857 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 74 [2022-11-20 10:33:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:49,857 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-20 10:33:49,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-20 10:33:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-20 10:33:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-20 10:33:49,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:49,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:49,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:50,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 10:33:50,068 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1941762549, now seen corresponding path program 1 times [2022-11-20 10:33:50,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:50,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874999702] [2022-11-20 10:33:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:33:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:51,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:33:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-20 10:33:51,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:51,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874999702] [2022-11-20 10:33:51,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874999702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:51,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117935578] [2022-11-20 10:33:51,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:51,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:51,227 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:51,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 10:33:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:51,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-20 10:33:51,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:51,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:33:51,801 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:33:51,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:33:51,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:33:51,986 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:51,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 10:33:52,110 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:52,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-20 10:33:52,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-20 10:33:52,539 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:33:52,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2022-11-20 10:33:52,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:52,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 10:33:53,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:53,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 29 [2022-11-20 10:33:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:33:53,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:54,173 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-20 10:33:54,582 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_5194) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-20 10:33:54,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5194) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-20 10:33:54,768 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (= (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5194)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-20 10:33:54,783 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (v_ArrVal_5191 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5191))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5194))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-20 10:33:55,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (v_ArrVal_5190 (Array Int Int)) (v_ArrVal_5191 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5190) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5191))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5194))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-20 10:33:55,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:55,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 57 [2022-11-20 10:33:55,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 201 [2022-11-20 10:33:55,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 238 [2022-11-20 10:33:55,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:55,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 323 [2022-11-20 10:33:55,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:55,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 439 treesize of output 437 [2022-11-20 10:33:55,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:55,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 542 treesize of output 543 [2022-11-20 10:33:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2022-11-20 10:33:56,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117935578] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:56,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:56,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 28] total 70 [2022-11-20 10:33:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220557112] [2022-11-20 10:33:56,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:56,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-20 10:33:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:56,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-20 10:33:56,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3723, Unknown=87, NotChecked=774, Total=4830 [2022-11-20 10:33:56,464 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 10:33:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:33:58,847 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-20 10:33:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:33:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 75 [2022-11-20 10:33:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:33:58,848 INFO L225 Difference]: With dead ends: 84 [2022-11-20 10:33:58,848 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:33:58,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=447, Invalid=5491, Unknown=92, NotChecked=942, Total=6972 [2022-11-20 10:33:58,849 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 230 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:33:58,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1356 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 832 Invalid, 0 Unknown, 657 Unchecked, 0.6s Time] [2022-11-20 10:33:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:33:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-20 10:33:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:33:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-11-20 10:33:58,852 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 75 [2022-11-20 10:33:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:33:58,853 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-11-20 10:33:58,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-20 10:33:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-11-20 10:33:58,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 10:33:58,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:33:58,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:33:58,864 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-20 10:33:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-20 10:33:59,059 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-20 10:33:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1283862180, now seen corresponding path program 1 times [2022-11-20 10:33:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:59,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701173693] [2022-11-20 10:33:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:34:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-20 10:34:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:34:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:01,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701173693] [2022-11-20 10:34:01,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701173693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:34:01,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008842527] [2022-11-20 10:34:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:01,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:34:01,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:34:01,417 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:34:01,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_114c19bc-3ded-47f8-83cc-d0d5f019e207/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 10:34:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:01,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-20 10:34:01,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:34:01,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 10:34:02,029 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:34:02,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:34:02,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:34:02,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:34:02,179 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:34:02,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-20 10:34:02,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:34:02,366 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 10:34:02,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-20 10:34:02,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-20 10:34:02,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:02,461 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:34:02,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-20 10:34:02,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:02,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-20 10:34:03,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:03,006 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:34:03,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2022-11-20 10:34:03,023 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-20 10:34:03,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-20 10:34:03,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:03,247 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:34:03,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-20 10:34:03,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 10:34:03,836 INFO L321 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-11-20 10:34:03,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-11-20 10:34:03,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:03,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-20 10:34:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 10:34:04,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:34:08,134 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse1 (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse3 (select (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_5411 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse3) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse4 (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-20 10:34:08,485 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_5411 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse5) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (select (store .cse6 |c_ULTIMATE.start_main_~s~0#1.base| .cse7) .cse8) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse8)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-20 10:34:10,739 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse4 .cse5 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 .cse5 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse6 |c_ULTIMATE.start_main_~s~0#1.base| .cse7) (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 .cse9 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse8) (forall ((v_ArrVal_5411 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse4 .cse9 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse8) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))))) is different from false [2022-11-20 10:34:10,936 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (and (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse4))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse7 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse6 .cse7 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse5) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse4))))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse8 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse6 .cse8 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse8 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse4))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_main_~s~0#1.base| .cse10) .cse11) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse4))))))))) is different from false [2022-11-20 10:34:11,209 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (and (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse3) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)))))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse7 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse7 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse8) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse8 |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse9 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse9 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse9 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse10 |c_ULTIMATE.start_main_~s~0#1.base| .cse11) (select .cse11 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-11-20 10:34:13,346 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (and (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (= (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 .cse3 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 .cse3 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse6) (select .cse6 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse7) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse9) .cse7) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0)))))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 .cse11 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse10) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 .cse11 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5411) .cse10) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))))) is different from false [2022-11-20 10:34:15,473 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (and (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= (select (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) .cse1) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse7 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse7 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse7 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9) (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse10 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse10 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5411) .cse11) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse11)))))))) is different from false [2022-11-20 10:34:26,410 WARN L233 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:34:49,180 WARN L233 SmtUtils]: Spent 16.97s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:35:09,025 WARN L233 SmtUtils]: Spent 14.92s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:35:35,425 WARN L233 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:35:36,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:36,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2933 treesize of output 2750 [2022-11-20 10:38:27,238 WARN L233 SmtUtils]: Spent 2.82m on a formula simplification that was a NOOP. DAG size: 123 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 10:38:27,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:27,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 456066588 treesize of output 448390166 [2022-11-20 10:39:31,551 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification that was a NOOP. DAG size: 9950 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 10:39:34,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:34,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 448390152 treesize of output 265351408 [2022-11-20 10:40:44,454 WARN L233 SmtUtils]: Spent 1.17m on a formula simplification that was a NOOP. DAG size: 9951 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)