./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:16:12,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:16:12,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:16:12,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:16:12,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:16:12,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:16:12,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:16:12,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:16:12,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:16:12,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:16:12,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:16:12,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:16:12,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:16:12,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:16:12,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:16:12,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:16:12,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:16:12,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:16:12,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:16:12,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:16:12,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:16:12,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:16:12,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:16:12,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:16:12,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:16:12,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:16:12,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:16:12,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:16:12,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:16:12,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:16:12,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:16:12,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:16:12,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:16:12,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:16:12,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:16:12,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:16:12,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:16:12,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:16:12,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:16:12,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:16:12,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:16:12,881 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:16:12,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:16:12,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:16:12,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:16:12,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:16:12,905 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:16:12,905 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:16:12,906 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:16:12,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:16:12,907 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:16:12,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:16:12,907 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:16:12,908 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:16:12,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:16:12,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:16:12,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:16:12,909 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:16:12,909 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:16:12,909 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:16:12,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:16:12,910 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:16:12,910 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:16:12,910 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:16:12,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:16:12,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:16:12,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:16:12,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:16:12,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:16:12,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:16:12,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:16:12,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:16:12,913 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_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd9bd7b6c1446abd728b90c98a54cb367face4c5994cfeca4979c2dbc50ad4d3 [2022-11-02 20:16:13,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:16:13,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:16:13,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:16:13,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:16:13,249 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:16:13,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2022-11-02 20:16:13,341 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/data/7cde7f284/503cd020999342b1a84724ee28cff5ad/FLAG5bf935bc9 [2022-11-02 20:16:13,968 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:16:13,968 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2022-11-02 20:16:13,980 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/data/7cde7f284/503cd020999342b1a84724ee28cff5ad/FLAG5bf935bc9 [2022-11-02 20:16:14,270 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/data/7cde7f284/503cd020999342b1a84724ee28cff5ad [2022-11-02 20:16:14,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:16:14,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:16:14,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:16:14,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:16:14,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:16:14,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a2b226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14, skipping insertion in model container [2022-11-02 20:16:14,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:16:14,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:16:14,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2022-11-02 20:16:14,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:16:14,684 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:16:14,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/sv-benchmarks/c/list-simple/sll2c_remove_all.i[24082,24095] [2022-11-02 20:16:14,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:16:14,789 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:16:14,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14 WrapperNode [2022-11-02 20:16:14,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:16:14,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:16:14,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:16:14,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:16:14,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,860 INFO L138 Inliner]: procedures = 126, calls = 36, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2022-11-02 20:16:14,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:16:14,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:16:14,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:16:14,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:16:14,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,913 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:16:14,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:16:14,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:16:14,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:16:14,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (1/1) ... [2022-11-02 20:16:14,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:16:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:14,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:16:14,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:16:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:16:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:16:15,011 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:16:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:16:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:16:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:16:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:16:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:16:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:16:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:16:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:16:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:16:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:16:15,170 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:16:15,172 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:16:15,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:16:15,672 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:16:15,673 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:16:15,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:16:15 BoogieIcfgContainer [2022-11-02 20:16:15,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:16:15,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:16:15,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:16:15,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:16:15,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:16:14" (1/3) ... [2022-11-02 20:16:15,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726ba6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:16:15, skipping insertion in model container [2022-11-02 20:16:15,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:14" (2/3) ... [2022-11-02 20:16:15,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726ba6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:16:15, skipping insertion in model container [2022-11-02 20:16:15,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:16:15" (3/3) ... [2022-11-02 20:16:15,688 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2022-11-02 20:16:15,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:16:15,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-02 20:16:15,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:16:15,762 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;@f029330, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:16:15,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-11-02 20:16:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 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-02 20:16:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:16:15,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:15,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:16:15,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:15,782 INFO L85 PathProgramCache]: Analyzing trace with hash 893736149, now seen corresponding path program 1 times [2022-11-02 20:16:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60366312] [2022-11-02 20:16:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:16,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60366312] [2022-11-02 20:16:16,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60366312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:16,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:16,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:16:16,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454724633] [2022-11-02 20:16:16,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:16,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:16:16,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:16:16,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:16:16,095 INFO L87 Difference]: Start difference. First operand has 93 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 89 states have internal predecessors, (98), 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-02 20:16:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:16,231 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-11-02 20:16:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:16:16,234 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-02 20:16:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:16,242 INFO L225 Difference]: With dead ends: 91 [2022-11-02 20:16:16,242 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:16:16,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:16:16,247 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:16,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 134 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:16:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-02 20:16:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 84 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-02 20:16:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-11-02 20:16:16,285 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 6 [2022-11-02 20:16:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:16,285 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-02 20:16:16,286 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-02 20:16:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-11-02 20:16:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:16:16,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:16,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:16:16,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:16:16,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash 893736150, now seen corresponding path program 1 times [2022-11-02 20:16:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107839186] [2022-11-02 20:16:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:16,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107839186] [2022-11-02 20:16:16,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107839186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:16,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:16,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:16:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164248866] [2022-11-02 20:16:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:16,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:16:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:16,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:16:16,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:16:16,499 INFO L87 Difference]: Start difference. First operand 88 states and 92 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-02 20:16:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:16,609 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-11-02 20:16:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:16:16,610 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-02 20:16:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:16,613 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:16:16,613 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:16:16,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:16:16,618 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:16,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:16:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-02 20:16:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.9111111111111112) 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-02 20:16:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-02 20:16:16,626 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 6 [2022-11-02 20:16:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:16,627 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-02 20:16:16,627 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-02 20:16:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-02 20:16:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:16:16,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:16,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:16,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:16:16,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:16,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1919809879, now seen corresponding path program 1 times [2022-11-02 20:16:16,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:16,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371523189] [2022-11-02 20:16:16,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:16,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:16,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:16,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371523189] [2022-11-02 20:16:16,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371523189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:16,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:16,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244245789] [2022-11-02 20:16:16,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:16,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:16,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:16,800 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-02 20:16:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:16,901 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2022-11-02 20:16:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:16,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-11-02 20:16:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:16,903 INFO L225 Difference]: With dead ends: 93 [2022-11-02 20:16:16,903 INFO L226 Difference]: Without dead ends: 93 [2022-11-02 20:16:16,904 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-02 20:16:16,905 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 5 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:16,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 201 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-02 20:16:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2022-11-02 20:16:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 83 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-02 20:16:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-11-02 20:16:16,915 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 13 [2022-11-02 20:16:16,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:16,916 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-11-02 20:16:16,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-02 20:16:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-11-02 20:16:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:16:16,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:16,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:16,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:16:16,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 951797020, now seen corresponding path program 1 times [2022-11-02 20:16:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835697388] [2022-11-02 20:16:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:16,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:17,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:16:17,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:17,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835697388] [2022-11-02 20:16:17,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835697388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:17,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:17,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:16:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728954525] [2022-11-02 20:16:17,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:17,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:16:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:16:17,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:16:17,156 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-02 20:16:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:17,444 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-11-02 20:16:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:16:17,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-11-02 20:16:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:17,447 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:16:17,447 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:16:17,448 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-02 20:16:17,449 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 67 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:17,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 245 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:16:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:16:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 86. [2022-11-02 20:16:17,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 46 states have (on average 1.8695652173913044) 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-02 20:16:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-02 20:16:17,460 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 22 [2022-11-02 20:16:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:17,461 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-02 20:16:17,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-02 20:16:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-02 20:16:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:16:17,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:17,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:17,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:16:17,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash 951797021, now seen corresponding path program 1 times [2022-11-02 20:16:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:17,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187641019] [2022-11-02 20:16:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:17,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:17,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187641019] [2022-11-02 20:16:17,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187641019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:17,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:17,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:16:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780061231] [2022-11-02 20:16:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:17,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:16:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:17,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:16:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:16:17,957 INFO L87 Difference]: Start difference. First operand 86 states and 90 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-02 20:16:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:18,197 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-11-02 20:16:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:16:18,198 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 22 [2022-11-02 20:16:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:18,199 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:16:18,199 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:16:18,199 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-02 20:16:18,200 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 76 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:18,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 231 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:16:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:16:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-11-02 20:16:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 46 states have (on average 1.8478260869565217) 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-02 20:16:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-02 20:16:18,207 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 22 [2022-11-02 20:16:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:18,207 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-02 20:16:18,208 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-02 20:16:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-02 20:16:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:16:18,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:18,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:18,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:16:18,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:18,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -389076539, now seen corresponding path program 1 times [2022-11-02 20:16:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:18,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104612256] [2022-11-02 20:16:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:18,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:16:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:18,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104612256] [2022-11-02 20:16:18,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104612256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:18,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746701392] [2022-11-02 20:16:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:18,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:18,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:18,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:16:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:18,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:16:18,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:18,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:16:18,955 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:16:18,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:16:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:18,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:19,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746701392] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:19,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:16:19,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-02 20:16:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896034467] [2022-11-02 20:16:19,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:16:19,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:16:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:16:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:16:19,046 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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-02 20:16:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:19,326 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2022-11-02 20:16:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:16:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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 25 [2022-11-02 20:16:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:19,328 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:16:19,328 INFO L226 Difference]: Without dead ends: 138 [2022-11-02 20:16:19,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:16:19,334 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 65 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:19,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 247 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 2 Unchecked, 0.2s Time] [2022-11-02 20:16:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-02 20:16:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 84. [2022-11-02 20:16:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 46 states have (on average 1.826086956521739) internal successors, (84), 80 states have internal predecessors, (84), 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-02 20:16:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-11-02 20:16:19,347 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 25 [2022-11-02 20:16:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:19,347 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-11-02 20:16:19,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 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-02 20:16:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-11-02 20:16:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:16:19,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:19,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:19,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:16:19,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:16:19,569 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:19,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash -389076538, now seen corresponding path program 1 times [2022-11-02 20:16:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:19,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759552235] [2022-11-02 20:16:19,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:19,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:20,088 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-02 20:16:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759552235] [2022-11-02 20:16:20,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759552235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812521540] [2022-11-02 20:16:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:20,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:20,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:20,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:16:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:20,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 20:16:20,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:20,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:16:20,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:16:20,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:16:20,582 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:16:20,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:16:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:20,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:20,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812521540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:20,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:16:20,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2022-11-02 20:16:20,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413633823] [2022-11-02 20:16:20,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:16:20,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:16:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:16:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:16:20,777 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 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-02 20:16:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:21,296 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-11-02 20:16:21,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:16:21,301 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 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 25 [2022-11-02 20:16:21,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:21,302 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:16:21,302 INFO L226 Difference]: Without dead ends: 138 [2022-11-02 20:16:21,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:16:21,303 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 372 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:21,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 286 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 558 Invalid, 0 Unknown, 3 Unchecked, 0.4s Time] [2022-11-02 20:16:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-02 20:16:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2022-11-02 20:16:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.8043478260869565) 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-02 20:16:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-11-02 20:16:21,308 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 25 [2022-11-02 20:16:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:21,309 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-11-02 20:16:21,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 15 states have internal predecessors, (40), 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-02 20:16:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-11-02 20:16:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:16:21,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:21,310 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:21,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:21,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:21,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:21,530 INFO L85 PathProgramCache]: Analyzing trace with hash 904455987, now seen corresponding path program 1 times [2022-11-02 20:16:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:21,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064508923] [2022-11-02 20:16:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:21,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:21,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:21,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:16:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:21,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064508923] [2022-11-02 20:16:21,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064508923] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:21,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235743293] [2022-11-02 20:16:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:21,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:21,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:21,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:21,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:16:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:21,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:16:21,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:16:21,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:16:21,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235743293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:21,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:16:21,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-02 20:16:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167598599] [2022-11-02 20:16:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:21,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:21,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:21,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:16:21,902 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-02 20:16:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:21,919 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2022-11-02 20:16:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2022-11-02 20:16:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:21,923 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:16:21,924 INFO L226 Difference]: Without dead ends: 138 [2022-11-02 20:16:21,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:16:21,925 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 122 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:21,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 171 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:16:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-02 20:16:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 84. [2022-11-02 20:16:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 80 states have internal predecessors, (84), 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-02 20:16:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-11-02 20:16:21,936 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 29 [2022-11-02 20:16:21,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:21,936 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-11-02 20:16:21,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-02 20:16:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-11-02 20:16:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:16:21,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:21,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:21,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:22,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:16:22,152 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 904455976, now seen corresponding path program 1 times [2022-11-02 20:16:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:22,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456445117] [2022-11-02 20:16:22,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:22,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:22,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:16:22,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:22,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456445117] [2022-11-02 20:16:22,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456445117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:22,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772571559] [2022-11-02 20:16:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:22,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:22,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:22,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:22,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:16:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:22,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:16:22,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:22,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:16:22,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:16:22,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:16:22,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:16:22,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:16:23,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:16:23,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:16:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:16:23,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:23,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772571559] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:23,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:16:23,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2022-11-02 20:16:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071424354] [2022-11-02 20:16:23,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:16:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:16:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:23,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:16:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:16:23,135 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:16:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:23,636 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-02 20:16:23,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:16:23,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-11-02 20:16:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:23,638 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:16:23,638 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:16:23,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:16:23,639 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 145 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:23,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 321 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 354 Invalid, 0 Unknown, 82 Unchecked, 0.4s Time] [2022-11-02 20:16:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:16:23,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 80. [2022-11-02 20:16:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.6875) internal successors, (81), 76 states have internal predecessors, (81), 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-02 20:16:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-02 20:16:23,644 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 29 [2022-11-02 20:16:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:23,644 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-02 20:16:23,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:16:23,645 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-02 20:16:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:16:23,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:23,647 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:23,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:23,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:23,848 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash 904455977, now seen corresponding path program 1 times [2022-11-02 20:16:23,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:23,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840254455] [2022-11-02 20:16:23,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:24,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:24,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:16:24,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:24,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840254455] [2022-11-02 20:16:24,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840254455] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:24,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930675518] [2022-11-02 20:16:24,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:24,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:24,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:24,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:24,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:16:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:24,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:16:24,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:24,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:16:24,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:16:24,670 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-02 20:16:24,673 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-02 20:16:24,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:16:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:16:24,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:25,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930675518] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:25,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:16:25,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2022-11-02 20:16:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617005618] [2022-11-02 20:16:25,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:16:25,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:16:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:25,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:16:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=186, Unknown=2, NotChecked=28, Total=272 [2022-11-02 20:16:25,024 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 14 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:16:25,073 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 4))) is different from false [2022-11-02 20:16:25,076 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 4))) is different from true [2022-11-02 20:16:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:25,308 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-11-02 20:16:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:16:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-11-02 20:16:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:25,309 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:16:25,310 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 20:16:25,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=228, Unknown=4, NotChecked=66, Total=380 [2022-11-02 20:16:25,311 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 256 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:25,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 154 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 226 Invalid, 0 Unknown, 71 Unchecked, 0.2s Time] [2022-11-02 20:16:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 20:16:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:16:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 67 states have internal predecessors, (71), 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-02 20:16:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-11-02 20:16:25,318 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 29 [2022-11-02 20:16:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:25,320 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-11-02 20:16:25,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:16:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-11-02 20:16:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:16:25,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:25,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:25,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:25,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:25,549 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:25,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2026635805, now seen corresponding path program 1 times [2022-11-02 20:16:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:25,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995665311] [2022-11-02 20:16:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:25,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:25,793 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-02 20:16:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:25,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995665311] [2022-11-02 20:16:25,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995665311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:25,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:25,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:16:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511623784] [2022-11-02 20:16:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:25,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:16:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:16:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:16:25,796 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-02 20:16:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:26,203 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-11-02 20:16:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:16:26,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-02 20:16:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:26,204 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:16:26,205 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:16:26,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:16:26,206 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 172 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:26,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 330 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:16:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:16:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2022-11-02 20:16:26,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.489795918367347) internal successors, (73), 68 states have internal predecessors, (73), 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-02 20:16:26,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-02 20:16:26,209 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 30 [2022-11-02 20:16:26,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:26,209 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-02 20:16:26,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 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-02 20:16:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-02 20:16:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:16:26,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:26,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:16:26,211 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2026635804, now seen corresponding path program 1 times [2022-11-02 20:16:26,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:26,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881309023] [2022-11-02 20:16:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:26,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:26,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:26,640 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-02 20:16:26,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881309023] [2022-11-02 20:16:26,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881309023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:26,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:26,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:16:26,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601998815] [2022-11-02 20:16:26,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:26,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:16:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:26,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:16:26,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:16:26,643 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-02 20:16:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:27,044 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-11-02 20:16:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:16:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-02 20:16:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:27,045 INFO L225 Difference]: With dead ends: 99 [2022-11-02 20:16:27,045 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 20:16:27,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:16:27,046 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 310 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:27,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 312 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:16:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 20:16:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2022-11-02 20:16:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.469387755102041) internal successors, (72), 68 states have internal predecessors, (72), 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-02 20:16:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-11-02 20:16:27,049 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 30 [2022-11-02 20:16:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:27,050 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-11-02 20:16:27,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 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-02 20:16:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-11-02 20:16:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:16:27,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:27,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:27,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:16:27,051 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1055563858, now seen corresponding path program 1 times [2022-11-02 20:16:27,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:27,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871006995] [2022-11-02 20:16:27,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:27,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:27,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:27,295 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-02 20:16:27,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:27,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871006995] [2022-11-02 20:16:27,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871006995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:27,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:27,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:16:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915858613] [2022-11-02 20:16:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:27,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:16:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:16:27,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:16:27,298 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-02 20:16:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:27,648 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-11-02 20:16:27,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:16:27,649 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-02 20:16:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:27,650 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:16:27,650 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:16:27,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:16:27,651 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 363 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:27,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 375 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:16:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:16:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2022-11-02 20:16:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 80 states have internal predecessors, (92), 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-02 20:16:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-11-02 20:16:27,654 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 35 [2022-11-02 20:16:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:27,655 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-11-02 20:16:27,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-02 20:16:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-11-02 20:16:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:16:27,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:27,656 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:27,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:16:27,656 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1636827734, now seen corresponding path program 1 times [2022-11-02 20:16:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:27,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060796854] [2022-11-02 20:16:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:27,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:16:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:27,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060796854] [2022-11-02 20:16:27,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060796854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:27,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:27,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:16:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664769747] [2022-11-02 20:16:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:27,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:16:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:16:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:16:27,771 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-02 20:16:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:27,944 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2022-11-02 20:16:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:16:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 36 [2022-11-02 20:16:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:27,945 INFO L225 Difference]: With dead ends: 84 [2022-11-02 20:16:27,945 INFO L226 Difference]: Without dead ends: 84 [2022-11-02 20:16:27,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:16:27,946 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 37 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:27,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 192 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-02 20:16:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-02 20:16:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 79 states have internal predecessors, (92), 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-02 20:16:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2022-11-02 20:16:27,949 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 36 [2022-11-02 20:16:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:27,949 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2022-11-02 20:16:27,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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-02 20:16:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2022-11-02 20:16:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:16:27,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:27,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:27,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:16:27,950 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:27,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1636827733, now seen corresponding path program 1 times [2022-11-02 20:16:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:27,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086458344] [2022-11-02 20:16:27,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:28,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:28,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:28,469 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-02 20:16:28,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:28,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086458344] [2022-11-02 20:16:28,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086458344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:28,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:28,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:16:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258688392] [2022-11-02 20:16:28,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:28,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:16:28,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:16:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:16:28,472 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-02 20:16:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:29,051 INFO L93 Difference]: Finished difference Result 131 states and 148 transitions. [2022-11-02 20:16:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:16:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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 36 [2022-11-02 20:16:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:29,053 INFO L225 Difference]: With dead ends: 131 [2022-11-02 20:16:29,053 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:16:29,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:16:29,056 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 359 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:29,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 395 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:16:29,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:16:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2022-11-02 20:16:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 89 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-02 20:16:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2022-11-02 20:16:29,064 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 36 [2022-11-02 20:16:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:29,064 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-11-02 20:16:29,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-02 20:16:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2022-11-02 20:16:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:16:29,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:29,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:29,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:16:29,067 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:29,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1637258683, now seen corresponding path program 1 times [2022-11-02 20:16:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:29,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411615521] [2022-11-02 20:16:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:29,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:29,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:29,381 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-02 20:16:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:29,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411615521] [2022-11-02 20:16:29,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411615521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:29,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:29,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:16:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265300804] [2022-11-02 20:16:29,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:29,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:16:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:16:29,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:16:29,384 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 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-02 20:16:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:29,811 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2022-11-02 20:16:29,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:16:29,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 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 36 [2022-11-02 20:16:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:29,813 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:16:29,813 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:16:29,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:16:29,814 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 274 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:29,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 298 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:16:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:16:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-11-02 20:16:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 92 states have internal predecessors, (107), 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-02 20:16:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-11-02 20:16:29,818 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 36 [2022-11-02 20:16:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:29,818 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-11-02 20:16:29,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 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-02 20:16:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-11-02 20:16:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:16:29,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:29,819 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:29,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:16:29,820 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:29,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash 784588468, now seen corresponding path program 1 times [2022-11-02 20:16:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:29,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018981930] [2022-11-02 20:16:29,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:16:29,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:29,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018981930] [2022-11-02 20:16:29,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018981930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:29,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:29,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:16:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445113322] [2022-11-02 20:16:29,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:29,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:16:29,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:29,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:16:29,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:16:29,928 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-02 20:16:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:30,045 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-11-02 20:16:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:16:30,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 37 [2022-11-02 20:16:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:30,046 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:16:30,046 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:16:30,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:16:30,047 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:30,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 175 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:16:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-02 20:16:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.4) internal successors, (105), 91 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-02 20:16:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-11-02 20:16:30,050 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 37 [2022-11-02 20:16:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:30,051 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-11-02 20:16:30,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-02 20:16:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-11-02 20:16:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:16:30,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:30,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:30,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:16:30,052 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1447561176, now seen corresponding path program 1 times [2022-11-02 20:16:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:30,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355474703] [2022-11-02 20:16:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:30,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:30,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:30,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355474703] [2022-11-02 20:16:30,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355474703] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89882751] [2022-11-02 20:16:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:30,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:30,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:16:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:30,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:16:30,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:30,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:16:30,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:16:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:16:30,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:16:30,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89882751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:30,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:16:30,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2022-11-02 20:16:30,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837343622] [2022-11-02 20:16:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:30,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:16:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:16:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:16:30,744 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-02 20:16:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:30,878 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-11-02 20:16:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:16:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 38 [2022-11-02 20:16:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:30,879 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:16:30,879 INFO L226 Difference]: Without dead ends: 94 [2022-11-02 20:16:30,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:16:30,880 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 156 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:30,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 91 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-02 20:16:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-02 20:16:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 90 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-02 20:16:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-11-02 20:16:30,884 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 38 [2022-11-02 20:16:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:30,884 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-11-02 20:16:30,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-02 20:16:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-11-02 20:16:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:16:30,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:30,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:30,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:31,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:16:31,086 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:31,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:31,086 INFO L85 PathProgramCache]: Analyzing trace with hash -306294352, now seen corresponding path program 1 times [2022-11-02 20:16:31,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:31,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164802188] [2022-11-02 20:16:31,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:16:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:31,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164802188] [2022-11-02 20:16:31,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164802188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:31,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:31,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:16:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003737830] [2022-11-02 20:16:31,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:31,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:16:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:31,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:16:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:16:31,475 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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-02 20:16:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:31,860 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-11-02 20:16:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:16:31,862 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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-02 20:16:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:31,862 INFO L225 Difference]: With dead ends: 99 [2022-11-02 20:16:31,863 INFO L226 Difference]: Without dead ends: 99 [2022-11-02 20:16:31,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:16:31,863 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:31,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 416 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:16:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-02 20:16:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-11-02 20:16:31,866 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-02 20:16:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-11-02 20:16:31,866 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 41 [2022-11-02 20:16:31,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:31,867 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-11-02 20:16:31,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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-02 20:16:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-11-02 20:16:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:16:31,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:31,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:31,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:16:31,868 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:31,868 INFO L85 PathProgramCache]: Analyzing trace with hash -306241737, now seen corresponding path program 1 times [2022-11-02 20:16:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:31,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628815974] [2022-11-02 20:16:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:31,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628815974] [2022-11-02 20:16:32,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628815974] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345398045] [2022-11-02 20:16:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:32,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:32,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:32,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:32,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:16:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:32,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:16:32,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:32,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:16:33,091 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:16:33,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:16:33,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:16:33,309 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:16:33,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:16:33,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-02 20:16:33,749 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-02 20:16:33,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2022-11-02 20:16:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:33,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:33,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-11-02 20:16:33,939 INFO L356 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2022-11-02 20:16:33,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-11-02 20:16:33,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1509 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1509))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse0 .cse1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)))))) is different from false [2022-11-02 20:16:33,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1509 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1509))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse0 .cse1) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-11-02 20:16:33,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:33,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2022-11-02 20:16:34,039 INFO L356 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2022-11-02 20:16:34,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 120 [2022-11-02 20:16:34,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:34,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 87 [2022-11-02 20:16:34,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345398045] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:34,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:16:34,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2022-11-02 20:16:34,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266401449] [2022-11-02 20:16:34,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:16:34,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 20:16:34,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:34,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 20:16:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1612, Unknown=2, NotChecked=162, Total=1892 [2022-11-02 20:16:34,375 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 33 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:16:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:35,597 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-11-02 20:16:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:16:35,598 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 33 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2022-11-02 20:16:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:35,599 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:16:35,599 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 20:16:35,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=2400, Unknown=2, NotChecked=202, Total=2862 [2022-11-02 20:16:35,602 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 177 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:35,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 743 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 971 Invalid, 0 Unknown, 69 Unchecked, 0.6s Time] [2022-11-02 20:16:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 20:16:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2022-11-02 20:16:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.309278350515464) internal successors, (127), 112 states have internal predecessors, (127), 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-02 20:16:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2022-11-02 20:16:35,613 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 41 [2022-11-02 20:16:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:35,614 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-11-02 20:16:35,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.837837837837838) internal successors, (68), 33 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:16:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-11-02 20:16:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:16:35,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:35,617 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:35,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:35,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:35,840 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -306241736, now seen corresponding path program 1 times [2022-11-02 20:16:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:35,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220997097] [2022-11-02 20:16:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:36,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:37,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:37,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220997097] [2022-11-02 20:16:37,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220997097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:37,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913807217] [2022-11-02 20:16:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:37,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:37,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:37,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:37,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:16:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:37,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-02 20:16:37,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:37,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:16:37,639 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:16:37,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:16:37,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:16:37,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:16:37,924 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:16:37,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:16:37,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:16:38,575 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-02 20:16:38,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-11-02 20:16:38,588 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:16:38,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-02 20:16:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:38,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:39,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:39,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 130 [2022-11-02 20:16:39,491 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse1 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (<= 0 (select (select .cse1 .cse0) .cse2)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1627 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1627) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1628 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1628))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse3)) (< (select (select .cse4 .cse5) .cse3) 1))))) (not (= .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1627 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1627))) (let ((.cse6 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1628 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1628) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse7)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse8 .cse6) .cse7)))))))))) is different from false [2022-11-02 20:16:39,603 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_3))) (let ((.cse0 (select (select .cse1 v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_prenex_4) v_prenex_2) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (<= 0 (select (select .cse1 .cse2) .cse0)) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1627 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1627) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_1628 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1628))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (< (select (select .cse4 .cse5) .cse3) 1))))) (not (= .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1627 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1627))) (let ((.cse6 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1628 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1628) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse8 .cse6) .cse7)))))))))) is different from false [2022-11-02 20:16:39,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:39,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 52 [2022-11-02 20:16:39,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:39,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 44 [2022-11-02 20:16:39,693 INFO L356 Elim1Store]: treesize reduction 21, result has 73.1 percent of original size [2022-11-02 20:16:39,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 148 [2022-11-02 20:16:39,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:39,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 173 [2022-11-02 20:16:39,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 148 [2022-11-02 20:16:39,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:39,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 142 [2022-11-02 20:16:40,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:40,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2022-11-02 20:16:40,868 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:40,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-02 20:16:40,893 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:16:40,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 77 [2022-11-02 20:16:41,077 INFO L356 Elim1Store]: treesize reduction 67, result has 64.0 percent of original size [2022-11-02 20:16:41,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 186 treesize of output 260 [2022-11-02 20:16:41,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 124 [2022-11-02 20:16:41,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:41,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 189 [2022-11-02 20:16:41,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:41,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2022-11-02 20:16:41,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:41,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 44 [2022-11-02 20:16:42,000 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:16:42,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 77 [2022-11-02 20:16:42,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2022-11-02 20:16:42,175 INFO L356 Elim1Store]: treesize reduction 61, result has 64.1 percent of original size [2022-11-02 20:16:42,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 174 treesize of output 242 [2022-11-02 20:16:42,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:42,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 189 [2022-11-02 20:16:42,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913807217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:42,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:16:42,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2022-11-02 20:16:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527743444] [2022-11-02 20:16:42,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:16:42,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:16:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:16:42,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2718, Unknown=2, NotChecked=210, Total=3080 [2022-11-02 20:16:42,970 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 43 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 37 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:16:45,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:45,513 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2022-11-02 20:16:45,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:16:45,514 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 37 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 41 [2022-11-02 20:16:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:45,515 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:16:45,515 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:16:45,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=320, Invalid=4242, Unknown=2, NotChecked=266, Total=4830 [2022-11-02 20:16:45,518 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 249 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:45,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1393 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1357 Invalid, 0 Unknown, 119 Unchecked, 0.9s Time] [2022-11-02 20:16:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:16:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 120. [2022-11-02 20:16:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.3) internal successors, (130), 115 states have internal predecessors, (130), 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-02 20:16:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2022-11-02 20:16:45,523 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 41 [2022-11-02 20:16:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:45,523 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2022-11-02 20:16:45,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 37 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:16:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2022-11-02 20:16:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:16:45,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:45,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:45,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-02 20:16:45,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:45,753 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1471699153, now seen corresponding path program 1 times [2022-11-02 20:16:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:45,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844911748] [2022-11-02 20:16:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:45,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:16:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:45,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844911748] [2022-11-02 20:16:45,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844911748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:45,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:45,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579310592] [2022-11-02 20:16:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:45,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:16:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:45,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:16:45,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:16:45,860 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-02 20:16:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:45,944 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2022-11-02 20:16:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:16:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-02 20:16:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:45,946 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:16:45,946 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:16:45,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-02 20:16:45,947 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 66 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:45,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 105 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:16:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-02 20:16:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.27) internal successors, (127), 113 states have internal predecessors, (127), 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-02 20:16:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2022-11-02 20:16:45,956 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 41 [2022-11-02 20:16:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:45,956 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2022-11-02 20:16:45,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-02 20:16:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2022-11-02 20:16:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:16:45,958 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:45,958 INFO L195 NwaCegarLoop]: trace histogram [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-02 20:16:45,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:16:45,958 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1621966843, now seen corresponding path program 1 times [2022-11-02 20:16:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:45,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394047241] [2022-11-02 20:16:45,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:46,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:46,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394047241] [2022-11-02 20:16:46,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394047241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:46,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555927167] [2022-11-02 20:16:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:46,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:46,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:46,952 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:46,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:16:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:47,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-02 20:16:47,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:47,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:16:47,470 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:16:47,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:16:47,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:16:47,674 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:16:47,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-11-02 20:16:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:48,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:48,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2022-11-02 20:16:51,114 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:16:51,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 891 treesize of output 741 [2022-11-02 20:16:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:52,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555927167] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:16:52,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:16:52,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 62 [2022-11-02 20:16:52,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140574812] [2022-11-02 20:16:52,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:16:52,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-02 20:16:52,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-02 20:16:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3578, Unknown=1, NotChecked=0, Total=3782 [2022-11-02 20:16:52,215 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 62 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 53 states have internal predecessors, (92), 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-02 20:16:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:54,198 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2022-11-02 20:16:54,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:16:54,199 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 53 states have internal predecessors, (92), 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 42 [2022-11-02 20:16:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:54,200 INFO L225 Difference]: With dead ends: 130 [2022-11-02 20:16:54,200 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:16:54,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=452, Invalid=5399, Unknown=1, NotChecked=0, Total=5852 [2022-11-02 20:16:54,202 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 342 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:54,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1264 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1036 Invalid, 0 Unknown, 194 Unchecked, 0.7s Time] [2022-11-02 20:16:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:16:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2022-11-02 20:16:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.26) internal successors, (126), 113 states have internal predecessors, (126), 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-02 20:16:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2022-11-02 20:16:54,205 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 42 [2022-11-02 20:16:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:54,205 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2022-11-02 20:16:54,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 53 states have internal predecessors, (92), 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-02 20:16:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-11-02 20:16:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:16:54,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:54,206 INFO L195 NwaCegarLoop]: trace histogram [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-02 20:16:54,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:16:54,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:16:54,437 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:16:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 408363075, now seen corresponding path program 1 times [2022-11-02 20:16:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:54,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116018796] [2022-11-02 20:16:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:54,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:16:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:16:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:55,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:55,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116018796] [2022-11-02 20:16:55,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116018796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:16:55,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340386043] [2022-11-02 20:16:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:55,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:55,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:55,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:55,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:16:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:55,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:16:55,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:55,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-02 20:16:55,734 INFO L356 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-02 20:16:55,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 31 [2022-11-02 20:16:55,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:16:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:16:55,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:16:57,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2022-11-02 20:16:59,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2022-11-02 20:17:01,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) is different from false [2022-11-02 20:17:02,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2022-11-02 20:17:04,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2022-11-02 20:17:05,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem8#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2022-11-02 20:17:07,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.offset|))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2022-11-02 20:17:07,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2022-11-02 20:17:09,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_85 Int) (|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_85) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 .cse0))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) is different from false [2022-11-02 20:17:10,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_85 Int) (|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_85) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 .cse0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) is different from false [2022-11-02 20:17:10,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:17:10,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 43 [2022-11-02 20:17:10,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-02 20:17:10,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340386043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:17:10,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:17:10,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 33 [2022-11-02 20:17:10,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928078731] [2022-11-02 20:17:10,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:17:10,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:17:10,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:10,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:17:10,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=530, Unknown=9, NotChecked=486, Total=1122 [2022-11-02 20:17:10,740 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:17:12,657 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_arrayElimCell_85 Int) (|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_85) .cse1))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 .cse0))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= .cse1 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))) is different from false [2022-11-02 20:17:14,377 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (= .cse0 0) (forall ((v_arrayElimCell_85 Int) (|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| v_arrayElimCell_85) .cse0))) (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse1 .cse1))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0))) is different from false [2022-11-02 20:17:16,379 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.offset|))) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= .cse1 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.offset|) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem7#1.base|) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0))) is different from false [2022-11-02 20:17:17,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem8#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= .cse1 0) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem8#1.offset|) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0)))) is different from false [2022-11-02 20:17:19,070 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) .cse1))) (and (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|) (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) .cse0 |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0)))) is different from false [2022-11-02 20:17:21,073 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.base|))) (and (= .cse0 0) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) (= |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset| (select .cse1 .cse0)) (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select .cse1 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem11#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0))) is different from false [2022-11-02 20:17:22,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (= .cse0 0) (= |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset| (select .cse1 .cse0)) (forall ((|v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| Int)) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_first_~last~1#1.base_25|) (select .cse1 |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (= .cse0 |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0))) is different from false [2022-11-02 20:17:24,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (= .cse0 0) (exists ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) .cse0))) (and (= |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset| .cse1) (= .cse1 |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.offset|)))) (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_#t~mem14#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0))) is different from false [2022-11-02 20:17:25,964 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|))) (and (= .cse0 0) (forall ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset|)) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.base|) |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset|) 0)) (exists ((|ULTIMATE.start_sll_circular_remove_first_~last~1#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_first_~last~1#1.base|) .cse0))) (and (= .cse1 |c_ULTIMATE.start_sll_circular_remove_first_~last~1#1.offset|) (= |c_ULTIMATE.start_sll_circular_remove_first_~temp~1#1.offset| .cse1)))) (= |c_ULTIMATE.start_sll_circular_remove_first_~head#1.offset| 0))) is different from false [2022-11-02 20:17:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:26,101 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2022-11-02 20:17:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:17:26,102 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-11-02 20:17:26,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:26,102 INFO L225 Difference]: With dead ends: 140 [2022-11-02 20:17:26,103 INFO L226 Difference]: Without dead ends: 140 [2022-11-02 20:17:26,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=143, Invalid=781, Unknown=18, NotChecked=1314, Total=2256 [2022-11-02 20:17:26,104 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:26,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 763 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 398 Unchecked, 0.2s Time] [2022-11-02 20:17:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-02 20:17:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2022-11-02 20:17:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 121 states have internal predecessors, (138), 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-02 20:17:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2022-11-02 20:17:26,109 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 46 [2022-11-02 20:17:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:26,109 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2022-11-02 20:17:26,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 32 states have internal predecessors, (74), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:17:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2022-11-02 20:17:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:17:26,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:26,110 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:17:26,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:17:26,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:17:26,333 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-02 20:17:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 408415690, now seen corresponding path program 2 times [2022-11-02 20:17:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:26,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723518745] [2022-11-02 20:17:26,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:17:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:17:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:17:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:27,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723518745] [2022-11-02 20:17:27,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723518745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:17:27,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102867652] [2022-11-02 20:17:27,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:17:27,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:27,396 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:17:27,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c604ae4-e5ff-4746-916f-97b9101d9d20/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:17:27,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:17:27,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:17:27,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-02 20:17:27,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:17:27,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:17:28,018 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:17:28,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:17:28,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:17:28,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:17:28,371 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:17:28,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-02 20:17:28,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:17:29,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:29,129 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:17:29,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2022-11-02 20:17:29,345 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-02 20:17:29,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 31 [2022-11-02 20:17:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:29,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:17:29,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2083)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-02 20:17:29,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2083))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select |c_#valid| (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))) 1) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-11-02 20:17:29,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:30,980 INFO L356 Elim1Store]: treesize reduction 1806, result has 40.5 percent of original size [2022-11-02 20:17:30,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 18 new quantified variables, introduced 78 case distinctions, treesize of input 12304 treesize of output 10940 [2022-11-02 20:17:31,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:17:31,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 10477 treesize of output 9109 [2022-11-02 20:17:32,112 INFO L356 Elim1Store]: treesize reduction 136, result has 55.6 percent of original size [2022-11-02 20:17:32,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 12964 treesize of output 11557 [2022-11-02 20:17:33,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:17:33,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 11356 treesize of output 10890