./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8 --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- 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-e04fb08 [2022-11-16 12:20:13,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:20:13,024 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:20:13,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:20:13,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:20:13,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:20:13,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:20:13,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:20:13,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:20:13,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:20:13,080 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:20:13,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:20:13,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:20:13,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:20:13,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:20:13,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:20:13,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:20:13,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:20:13,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:20:13,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:20:13,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:20:13,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:20:13,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:20:13,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:20:13,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:20:13,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:20:13,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:20:13,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:20:13,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:20:13,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:20:13,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:20:13,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:20:13,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:20:13,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:20:13,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:20:13,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:20:13,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:20:13,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:20:13,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:20:13,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:20:13,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:20:13,134 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:20:13,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:20:13,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:20:13,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:20:13,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:20:13,197 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:20:13,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:20:13,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:20:13,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:20:13,198 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:20:13,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:20:13,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:20:13,200 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:20:13,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:20:13,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:20:13,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:20:13,201 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:20:13,201 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:20:13,202 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:20:13,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:20:13,202 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:20:13,202 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:20:13,203 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:20:13,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:20:13,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:20:13,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:20:13,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:20:13,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:20:13,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:20:13,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:20:13,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:20:13,205 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_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/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_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-16 12:20:13,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:20:13,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:20:13,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:20:13,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:20:13,541 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:20:13,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-16 12:20:13,619 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/data/73c8cd724/9f6edd11c2184787b49a70a674a6ac9d/FLAG2723838e6 [2022-11-16 12:20:14,286 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:20:14,293 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-16 12:20:14,314 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/data/73c8cd724/9f6edd11c2184787b49a70a674a6ac9d/FLAG2723838e6 [2022-11-16 12:20:14,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/data/73c8cd724/9f6edd11c2184787b49a70a674a6ac9d [2022-11-16 12:20:14,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:20:14,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:20:14,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:20:14,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:20:14,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:20:14,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:14" (1/1) ... [2022-11-16 12:20:14,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4d9378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:14, skipping insertion in model container [2022-11-16 12:20:14,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:20:14" (1/1) ... [2022-11-16 12:20:14,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:20:14,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:20:15,131 WARN L229 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_c150d7fa-0d4e-4453-b62f-a82f490bd55b/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-16 12:20:15,136 WARN L229 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_c150d7fa-0d4e-4453-b62f-a82f490bd55b/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-16 12:20:15,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:20:15,161 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:20:15,249 WARN L229 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_c150d7fa-0d4e-4453-b62f-a82f490bd55b/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-16 12:20:15,261 WARN L229 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_c150d7fa-0d4e-4453-b62f-a82f490bd55b/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-16 12:20:15,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:20:15,312 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:20:15,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15 WrapperNode [2022-11-16 12:20:15,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:20:15,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:20:15,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:20:15,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:20:15,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,403 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-11-16 12:20:15,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:20:15,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:20:15,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:20:15,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:20:15,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,450 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:20:15,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:20:15,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:20:15,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:20:15,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (1/1) ... [2022-11-16 12:20:15,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:20:15,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:20:15,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:20:15,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:20:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-16 12:20:15,544 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-16 12:20:15,544 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-16 12:20:15,545 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-16 12:20:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:20:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:20:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:20:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:20:15,545 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 12:20:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:20:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:20:15,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:20:15,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:20:15,548 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:20:15,721 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:20:15,730 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:20:16,396 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:20:16,407 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:20:16,407 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 12:20:16,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:16 BoogieIcfgContainer [2022-11-16 12:20:16,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:20:16,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:20:16,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:20:16,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:20:16,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:20:14" (1/3) ... [2022-11-16 12:20:16,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba1f680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:16, skipping insertion in model container [2022-11-16 12:20:16,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:20:15" (2/3) ... [2022-11-16 12:20:16,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba1f680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:20:16, skipping insertion in model container [2022-11-16 12:20:16,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:20:16" (3/3) ... [2022-11-16 12:20:16,421 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-16 12:20:16,442 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:20:16,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-16 12:20:16,442 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:20:16,629 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 12:20:16,678 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:20:16,694 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 287 places, 293 transitions, 602 flow [2022-11-16 12:20:16,699 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 287 places, 293 transitions, 602 flow [2022-11-16 12:20:16,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 293 transitions, 602 flow [2022-11-16 12:20:16,867 INFO L130 PetriNetUnfolder]: 13/291 cut-off events. [2022-11-16 12:20:16,868 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 12:20:16,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 291 events. 13/291 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 672 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-16 12:20:16,892 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-16 12:20:41,022 INFO L134 LiptonReduction]: Checked pairs total: 62284 [2022-11-16 12:20:41,022 INFO L136 LiptonReduction]: Total number of compositions: 466 [2022-11-16 12:20:41,031 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-16 12:20:41,236 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:41,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:20:41,261 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;@6528105b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:20:41,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-16 12:20:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:20:41,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:41,287 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:20:41,288 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1316, now seen corresponding path program 1 times [2022-11-16 12:20:41,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:41,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971237437] [2022-11-16 12:20:41,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:41,440 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-16 12:20:41,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:41,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971237437] [2022-11-16 12:20:41,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971237437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:41,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:41,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:20:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562597964] [2022-11-16 12:20:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:41,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:20:41,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:20:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:20:41,506 INFO L87 Difference]: Start difference. First operand has 5589 states, 4122 states have (on average 3.8469189713731198) internal successors, (15857), 5588 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:41,702 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-16 12:20:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:20:41,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 12:20:41,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:41,746 INFO L225 Difference]: With dead ends: 2668 [2022-11-16 12:20:41,747 INFO L226 Difference]: Without dead ends: 2668 [2022-11-16 12:20:41,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:20:41,752 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:41,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-16 12:20:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-16 12:20:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2340 states have (on average 3.2854700854700853) internal successors, (7688), 2667 states have internal predecessors, (7688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-16 12:20:41,938 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-16 12:20:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:41,938 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-16 12:20:41,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-16 12:20:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:20:41,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:41,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:20:41,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:20:41,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:41,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1292139, now seen corresponding path program 1 times [2022-11-16 12:20:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:41,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482390326] [2022-11-16 12:20:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:42,346 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-16 12:20:42,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:42,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482390326] [2022-11-16 12:20:42,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482390326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:42,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:42,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:20:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823213578] [2022-11-16 12:20:42,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:42,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:42,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:42,350 INFO L87 Difference]: Start difference. First operand 2668 states and 7688 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:42,505 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-16 12:20:42,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:42,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:20:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:42,525 INFO L225 Difference]: With dead ends: 2618 [2022-11-16 12:20:42,525 INFO L226 Difference]: Without dead ends: 2618 [2022-11-16 12:20:42,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-16 12:20:42,528 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:42,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-16 12:20:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-16 12:20:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2310 states have (on average 3.2826839826839826) internal successors, (7583), 2617 states have internal predecessors, (7583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-16 12:20:42,622 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-16 12:20:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:42,623 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-16 12:20:42,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-16 12:20:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:20:42,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:42,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:20:42,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:20:42,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1292140, now seen corresponding path program 1 times [2022-11-16 12:20:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:42,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136697950] [2022-11-16 12:20:42,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:42,731 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-16 12:20:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:42,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136697950] [2022-11-16 12:20:42,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136697950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:42,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:42,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:20:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471598014] [2022-11-16 12:20:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:42,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:42,735 INFO L87 Difference]: Start difference. First operand 2618 states and 7583 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:42,856 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-16 12:20:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:42,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-16 12:20:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:42,873 INFO L225 Difference]: With dead ends: 2568 [2022-11-16 12:20:42,874 INFO L226 Difference]: Without dead ends: 2568 [2022-11-16 12:20:42,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-16 12:20:42,878 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:42,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-16 12:20:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-16 12:20:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2280 states have (on average 3.2798245614035086) internal successors, (7478), 2567 states have internal predecessors, (7478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-16 12:20:42,976 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-16 12:20:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:42,976 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-16 12:20:42,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-16 12:20:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:20:42,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:42,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:20:42,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:20:42,978 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1241774886, now seen corresponding path program 1 times [2022-11-16 12:20:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:42,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051567790] [2022-11-16 12:20:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,606 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-16 12:20:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:43,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051567790] [2022-11-16 12:20:43,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051567790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:43,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:43,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:20:43,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670666029] [2022-11-16 12:20:43,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:43,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:43,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:43,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:43,609 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:43,772 INFO L93 Difference]: Finished difference Result 2575 states and 7493 transitions. [2022-11-16 12:20:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:43,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 12:20:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:43,787 INFO L225 Difference]: With dead ends: 2575 [2022-11-16 12:20:43,787 INFO L226 Difference]: Without dead ends: 2575 [2022-11-16 12:20:43,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-16 12:20:43,788 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:43,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2022-11-16 12:20:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2569. [2022-11-16 12:20:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2281 states have (on average 3.280140289346778) internal successors, (7482), 2568 states have internal predecessors, (7482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 7482 transitions. [2022-11-16 12:20:43,869 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 7482 transitions. Word has length 5 [2022-11-16 12:20:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:43,869 INFO L495 AbstractCegarLoop]: Abstraction has 2569 states and 7482 transitions. [2022-11-16 12:20:43,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 7482 transitions. [2022-11-16 12:20:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:20:43,870 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:43,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:20:43,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:20:43,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:43,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1241774839, now seen corresponding path program 1 times [2022-11-16 12:20:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:43,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985056847] [2022-11-16 12:20:43,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,969 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-16 12:20:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:43,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985056847] [2022-11-16 12:20:43,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985056847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:43,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:43,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:20:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405557979] [2022-11-16 12:20:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:43,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:43,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:43,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:43,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:43,974 INFO L87 Difference]: Start difference. First operand 2569 states and 7482 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:44,105 INFO L93 Difference]: Finished difference Result 2283 states and 6671 transitions. [2022-11-16 12:20:44,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:44,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 12:20:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:44,126 INFO L225 Difference]: With dead ends: 2283 [2022-11-16 12:20:44,126 INFO L226 Difference]: Without dead ends: 2283 [2022-11-16 12:20:44,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-16 12:20:44,128 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:44,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2022-11-16 12:20:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2283. [2022-11-16 12:20:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2073 states have (on average 3.218041485769416) internal successors, (6671), 2282 states have internal predecessors, (6671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 6671 transitions. [2022-11-16 12:20:44,217 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 6671 transitions. Word has length 5 [2022-11-16 12:20:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:44,217 INFO L495 AbstractCegarLoop]: Abstraction has 2283 states and 6671 transitions. [2022-11-16 12:20:44,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 6671 transitions. [2022-11-16 12:20:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:20:44,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:44,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:20:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:20:44,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1241770997, now seen corresponding path program 1 times [2022-11-16 12:20:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:44,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010701035] [2022-11-16 12:20:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:44,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:44,315 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-16 12:20:44,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:44,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010701035] [2022-11-16 12:20:44,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010701035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:44,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:44,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:20:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193879627] [2022-11-16 12:20:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:44,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:20:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:44,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:20:44,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:20:44,321 INFO L87 Difference]: Start difference. First operand 2283 states and 6671 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:44,432 INFO L93 Difference]: Finished difference Result 1737 states and 4918 transitions. [2022-11-16 12:20:44,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:44,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 12:20:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:44,450 INFO L225 Difference]: With dead ends: 1737 [2022-11-16 12:20:44,451 INFO L226 Difference]: Without dead ends: 1737 [2022-11-16 12:20:44,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:20:44,452 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:44,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2022-11-16 12:20:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1737. [2022-11-16 12:20:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1597 states have (on average 3.0795241077019413) internal successors, (4918), 1736 states have internal predecessors, (4918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 4918 transitions. [2022-11-16 12:20:44,504 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 4918 transitions. Word has length 5 [2022-11-16 12:20:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:44,505 INFO L495 AbstractCegarLoop]: Abstraction has 1737 states and 4918 transitions. [2022-11-16 12:20:44,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 4918 transitions. [2022-11-16 12:20:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 12:20:44,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:44,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 12:20:44,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:20:44,506 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1241770998, now seen corresponding path program 1 times [2022-11-16 12:20:44,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:44,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206619358] [2022-11-16 12:20:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:44,598 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-16 12:20:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:44,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206619358] [2022-11-16 12:20:44,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206619358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:44,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:44,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:20:44,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693081889] [2022-11-16 12:20:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:44,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:44,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:44,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:44,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:44,601 INFO L87 Difference]: Start difference. First operand 1737 states and 4918 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:44,696 INFO L93 Difference]: Finished difference Result 1191 states and 3165 transitions. [2022-11-16 12:20:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 12:20:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:44,702 INFO L225 Difference]: With dead ends: 1191 [2022-11-16 12:20:44,702 INFO L226 Difference]: Without dead ends: 1191 [2022-11-16 12:20:44,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-16 12:20:44,703 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:44,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2022-11-16 12:20:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2022-11-16 12:20:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1121 states have (on average 2.823371989295272) internal successors, (3165), 1190 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 3165 transitions. [2022-11-16 12:20:44,736 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 3165 transitions. Word has length 5 [2022-11-16 12:20:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:44,736 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 3165 transitions. [2022-11-16 12:20:44,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 3165 transitions. [2022-11-16 12:20:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:20:44,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:44,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:20:44,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:20:44,737 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash -159682190, now seen corresponding path program 1 times [2022-11-16 12:20:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:44,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041332288] [2022-11-16 12:20:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:44,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:44,867 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-16 12:20:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:44,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041332288] [2022-11-16 12:20:44,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041332288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:44,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:44,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:20:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818233616] [2022-11-16 12:20:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:44,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:20:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:20:44,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:20:44,869 INFO L87 Difference]: Start difference. First operand 1191 states and 3165 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:45,057 INFO L93 Difference]: Finished difference Result 1202 states and 3220 transitions. [2022-11-16 12:20:45,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:20:45,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:20:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:45,063 INFO L225 Difference]: With dead ends: 1202 [2022-11-16 12:20:45,063 INFO L226 Difference]: Without dead ends: 1202 [2022-11-16 12:20:45,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:20:45,064 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:45,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 12 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:20:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2022-11-16 12:20:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 915. [2022-11-16 12:20:45,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 887 states have (on average 2.763246899661781) internal successors, (2451), 914 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 2451 transitions. [2022-11-16 12:20:45,099 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 2451 transitions. Word has length 6 [2022-11-16 12:20:45,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:45,099 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 2451 transitions. [2022-11-16 12:20:45,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 2451 transitions. [2022-11-16 12:20:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:20:45,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:45,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:20:45,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:20:45,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:45,101 INFO L85 PathProgramCache]: Analyzing trace with hash -159686387, now seen corresponding path program 1 times [2022-11-16 12:20:45,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:45,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537026899] [2022-11-16 12:20:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:45,463 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-16 12:20:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537026899] [2022-11-16 12:20:45,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537026899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:45,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:45,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:20:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597434901] [2022-11-16 12:20:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:20:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:20:45,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:20:45,465 INFO L87 Difference]: Start difference. First operand 915 states and 2451 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:45,599 INFO L93 Difference]: Finished difference Result 1190 states and 3172 transitions. [2022-11-16 12:20:45,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:20:45,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:20:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:45,604 INFO L225 Difference]: With dead ends: 1190 [2022-11-16 12:20:45,605 INFO L226 Difference]: Without dead ends: 1190 [2022-11-16 12:20:45,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:20:45,605 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:45,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-11-16 12:20:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 998. [2022-11-16 12:20:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 970 states have (on average 2.8072164948453606) internal successors, (2723), 997 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-16 12:20:45,633 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-16 12:20:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:45,633 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-16 12:20:45,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-16 12:20:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:20:45,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:45,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:45,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:20:45,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1844995603, now seen corresponding path program 1 times [2022-11-16 12:20:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83669711] [2022-11-16 12:20:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:45,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:45,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83669711] [2022-11-16 12:20:45,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83669711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:45,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:45,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:20:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361903148] [2022-11-16 12:20:45,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:45,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:45,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:45,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:45,697 INFO L87 Difference]: Start difference. First operand 998 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:45,791 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-16 12:20:45,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:45,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 12:20:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:45,793 INFO L225 Difference]: With dead ends: 434 [2022-11-16 12:20:45,793 INFO L226 Difference]: Without dead ends: 426 [2022-11-16 12:20:45,794 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-16 12:20:45,794 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:45,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 9 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-16 12:20:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-16 12:20:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 387 states have (on average 2.41343669250646) internal successors, (934), 399 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-16 12:20:45,804 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-16 12:20:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:45,805 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-16 12:20:45,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-16 12:20:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:20:45,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:45,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:45,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:20:45,806 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:45,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:45,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1829498534, now seen corresponding path program 1 times [2022-11-16 12:20:45,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:45,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551671572] [2022-11-16 12:20:45,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:45,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:45,925 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-16 12:20:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:45,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551671572] [2022-11-16 12:20:45,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551671572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:45,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:45,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:20:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407025824] [2022-11-16 12:20:45,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:45,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:20:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:45,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:20:45,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:20:45,927 INFO L87 Difference]: Start difference. First operand 400 states and 934 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:45,999 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-16 12:20:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:20:46,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 12:20:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:46,002 INFO L225 Difference]: With dead ends: 380 [2022-11-16 12:20:46,002 INFO L226 Difference]: Without dead ends: 380 [2022-11-16 12:20:46,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-16 12:20:46,003 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:46,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-16 12:20:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-16 12:20:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 370 states have (on average 2.4054054054054053) internal successors, (890), 379 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-16 12:20:46,012 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-16 12:20:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:46,012 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-16 12:20:46,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-16 12:20:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:20:46,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:46,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:46,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:20:46,014 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1829498533, now seen corresponding path program 1 times [2022-11-16 12:20:46,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:46,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053504099] [2022-11-16 12:20:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:46,184 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-16 12:20:46,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:46,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053504099] [2022-11-16 12:20:46,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053504099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:46,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:46,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:20:46,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57011660] [2022-11-16 12:20:46,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:46,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:20:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:46,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:20:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:20:46,186 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:46,309 INFO L93 Difference]: Finished difference Result 476 states and 1106 transitions. [2022-11-16 12:20:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:20:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 12:20:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:46,311 INFO L225 Difference]: With dead ends: 476 [2022-11-16 12:20:46,311 INFO L226 Difference]: Without dead ends: 476 [2022-11-16 12:20:46,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:20:46,312 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 67 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:46,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-16 12:20:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-11-16 12:20:46,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 466 states have (on average 2.3733905579399144) internal successors, (1106), 475 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1106 transitions. [2022-11-16 12:20:46,324 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1106 transitions. Word has length 11 [2022-11-16 12:20:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:46,324 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 1106 transitions. [2022-11-16 12:20:46,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1106 transitions. [2022-11-16 12:20:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:20:46,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:46,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:46,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:20:46,326 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:46,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash -879876191, now seen corresponding path program 1 times [2022-11-16 12:20:46,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:46,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349227198] [2022-11-16 12:20:46,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:46,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349227198] [2022-11-16 12:20:46,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349227198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:46,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:46,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:20:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616612577] [2022-11-16 12:20:46,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:46,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:20:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:46,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:20:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:20:46,806 INFO L87 Difference]: Start difference. First operand 476 states and 1106 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:46,961 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-16 12:20:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:20:46,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 12:20:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:46,963 INFO L225 Difference]: With dead ends: 475 [2022-11-16 12:20:46,963 INFO L226 Difference]: Without dead ends: 475 [2022-11-16 12:20:46,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:20:46,964 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:46,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:20:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-16 12:20:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-16 12:20:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.372043010752688) internal successors, (1103), 474 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-16 12:20:46,976 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-16 12:20:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:46,976 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-16 12:20:46,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-16 12:20:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:20:46,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:46,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:46,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:20:46,978 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1389801802, now seen corresponding path program 1 times [2022-11-16 12:20:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:46,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365554628] [2022-11-16 12:20:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:46,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:47,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:47,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365554628] [2022-11-16 12:20:47,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365554628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:47,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:47,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:20:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792504743] [2022-11-16 12:20:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:47,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:20:47,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:20:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:20:47,735 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:47,931 INFO L93 Difference]: Finished difference Result 588 states and 1359 transitions. [2022-11-16 12:20:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:20:47,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 12:20:47,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:47,933 INFO L225 Difference]: With dead ends: 588 [2022-11-16 12:20:47,933 INFO L226 Difference]: Without dead ends: 588 [2022-11-16 12:20:47,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:20:47,934 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:47,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 15 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:20:47,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-11-16 12:20:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 497. [2022-11-16 12:20:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 487 states have (on average 2.3675564681724848) internal successors, (1153), 496 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1153 transitions. [2022-11-16 12:20:47,947 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1153 transitions. Word has length 13 [2022-11-16 12:20:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:47,947 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 1153 transitions. [2022-11-16 12:20:47,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1153 transitions. [2022-11-16 12:20:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:20:47,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:47,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:47,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:20:47,949 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:47,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1414266154, now seen corresponding path program 2 times [2022-11-16 12:20:47,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:47,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712890004] [2022-11-16 12:20:47,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712890004] [2022-11-16 12:20:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712890004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897957727] [2022-11-16 12:20:48,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:20:48,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:20:48,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:20:48,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:20:48,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:20:48,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:20:48,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:20:48,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 12:20:48,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:48,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:48,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:20:48,862 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-16 12:20:48,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2022-11-16 12:20:48,880 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:20:48,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:20:49,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-16 12:20:49,087 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:20:49,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 12:20:49,160 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:20:49,161 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 49 [2022-11-16 12:20:49,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:20:49,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-16 12:20:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:49,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:20:49,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897957727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:49,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:20:49,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 11 [2022-11-16 12:20:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351840401] [2022-11-16 12:20:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:49,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:20:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:20:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:20:49,337 INFO L87 Difference]: Start difference. First operand 497 states and 1153 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:49,524 INFO L93 Difference]: Finished difference Result 567 states and 1300 transitions. [2022-11-16 12:20:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:20:49,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 12:20:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:49,526 INFO L225 Difference]: With dead ends: 567 [2022-11-16 12:20:49,526 INFO L226 Difference]: Without dead ends: 567 [2022-11-16 12:20:49,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:20:49,527 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:49,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 30 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 177 Unchecked, 0.1s Time] [2022-11-16 12:20:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-11-16 12:20:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 498. [2022-11-16 12:20:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 488 states have (on average 2.3668032786885247) internal successors, (1155), 497 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1155 transitions. [2022-11-16 12:20:49,540 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1155 transitions. Word has length 13 [2022-11-16 12:20:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:49,540 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 1155 transitions. [2022-11-16 12:20:49,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1155 transitions. [2022-11-16 12:20:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:20:49,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:49,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:49,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:20:49,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:20:49,751 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1549526904, now seen corresponding path program 1 times [2022-11-16 12:20:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:49,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142449460] [2022-11-16 12:20:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:50,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:50,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142449460] [2022-11-16 12:20:50,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142449460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:50,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358573306] [2022-11-16 12:20:50,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:50,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:20:50,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:20:50,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:20:50,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:20:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:50,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 12:20:50,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:50,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:50,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:50,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:51,008 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:20:51,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-16 12:20:51,023 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:20:51,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:20:51,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-16 12:20:51,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:20:51,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-16 12:20:51,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:51,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-16 12:20:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:51,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:20:51,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_568 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_568 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:20:51,765 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_568 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_568 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:20:51,889 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_564 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_564) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_564 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_564) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-16 12:20:51,921 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_562 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_562))) (store (store .cse0 .cse1 v_ArrVal_564) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_562 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_562))) (store (store .cse6 .cse1 v_ArrVal_564) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_568) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:20:58,378 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:20:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:58,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358573306] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:20:58,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:20:58,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-11-16 12:20:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123999562] [2022-11-16 12:20:58,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:20:58,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 12:20:58,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 12:20:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=219, Unknown=8, NotChecked=140, Total=462 [2022-11-16 12:20:58,466 INFO L87 Difference]: Start difference. First operand 498 states and 1155 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:59,065 INFO L93 Difference]: Finished difference Result 499 states and 1158 transitions. [2022-11-16 12:20:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:20:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 12:20:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:59,067 INFO L225 Difference]: With dead ends: 499 [2022-11-16 12:20:59,067 INFO L226 Difference]: Without dead ends: 499 [2022-11-16 12:20:59,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=133, Invalid=295, Unknown=8, NotChecked=164, Total=600 [2022-11-16 12:20:59,068 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:59,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 224 Unchecked, 0.2s Time] [2022-11-16 12:20:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-16 12:20:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2022-11-16 12:20:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 489 states have (on average 2.3680981595092025) internal successors, (1158), 498 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1158 transitions. [2022-11-16 12:20:59,080 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 1158 transitions. Word has length 13 [2022-11-16 12:20:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:59,080 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 1158 transitions. [2022-11-16 12:20:59,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:20:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 1158 transitions. [2022-11-16 12:20:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:20:59,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:59,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:20:59,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:20:59,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:20:59,287 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:20:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash 996123656, now seen corresponding path program 3 times [2022-11-16 12:20:59,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:59,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755107181] [2022-11-16 12:20:59,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:59,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:20:59,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:59,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755107181] [2022-11-16 12:20:59,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755107181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:59,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:59,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:20:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547290189] [2022-11-16 12:20:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:59,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:20:59,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:59,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:20:59,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:20:59,853 INFO L87 Difference]: Start difference. First operand 499 states and 1158 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:00,206 INFO L93 Difference]: Finished difference Result 513 states and 1167 transitions. [2022-11-16 12:21:00,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:21:00,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 12:21:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:00,208 INFO L225 Difference]: With dead ends: 513 [2022-11-16 12:21:00,208 INFO L226 Difference]: Without dead ends: 513 [2022-11-16 12:21:00,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:21:00,209 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:00,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 23 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:21:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-11-16 12:21:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 465. [2022-11-16 12:21:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 455 states have (on average 2.3516483516483517) internal successors, (1070), 464 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1070 transitions. [2022-11-16 12:21:00,221 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1070 transitions. Word has length 13 [2022-11-16 12:21:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:00,221 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 1070 transitions. [2022-11-16 12:21:00,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1070 transitions. [2022-11-16 12:21:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:21:00,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:00,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:00,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:21:00,223 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:21:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:00,223 INFO L85 PathProgramCache]: Analyzing trace with hash -177351661, now seen corresponding path program 1 times [2022-11-16 12:21:00,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:00,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226722028] [2022-11-16 12:21:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:00,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:01,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226722028] [2022-11-16 12:21:01,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226722028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:01,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862028495] [2022-11-16 12:21:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:01,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:01,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:01,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:01,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:21:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:01,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-16 12:21:01,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:01,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:01,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:01,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:01,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:01,506 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:01,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-16 12:21:01,529 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:21:01,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:21:01,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:01,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-11-16 12:21:01,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-11-16 12:21:02,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:21:02,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-16 12:21:02,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:02,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:21:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:02,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:02,494 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_702 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_702 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:02,509 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_702 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_702 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:02,525 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_702 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_702 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:02,557 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_698) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_698 Int) (v_ArrVal_702 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_698) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-16 12:21:02,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_696))) (store (store .cse0 .cse1 v_ArrVal_698) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse5) 4)))) (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_696))) (store (store .cse6 .cse1 v_ArrVal_698) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:02,623 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_695))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (store (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4 v_ArrVal_696))) (store (store .cse1 .cse2 v_ArrVal_698) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse5))))) (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_695))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (store (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse4 v_ArrVal_696))) (store (store .cse7 .cse2 v_ArrVal_698) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse5))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:02,698 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (select |c_#memory_int| |c_~#queue~0.base|) .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| Int)) (or (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_695))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store (select .cse0 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| 4) |c_~#queue~0.offset|) v_ArrVal_696))) (store (store .cse1 .cse2 v_ArrVal_698) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| .cse4)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| .cse4)) (forall ((v_ArrVal_698 Int) (v_ArrVal_696 Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_695))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (select .cse5 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| 4) |c_~#queue~0.offset|) v_ArrVal_696))) (store (store .cse6 .cse2 v_ArrVal_698) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_702) |c_~#queue~0.base|) .cse3) 4))))))))) is different from false [2022-11-16 12:21:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 12:21:02,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862028495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:02,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:21:02,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-16 12:21:02,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109631497] [2022-11-16 12:21:02,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:02,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:21:02,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:02,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:21:02,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=269, Unknown=7, NotChecked=280, Total=650 [2022-11-16 12:21:02,811 INFO L87 Difference]: Start difference. First operand 465 states and 1070 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:04,287 INFO L93 Difference]: Finished difference Result 664 states and 1531 transitions. [2022-11-16 12:21:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:21:04,287 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 12:21:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:04,290 INFO L225 Difference]: With dead ends: 664 [2022-11-16 12:21:04,290 INFO L226 Difference]: Without dead ends: 664 [2022-11-16 12:21:04,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=153, Invalid=468, Unknown=7, NotChecked=364, Total=992 [2022-11-16 12:21:04,291 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 140 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:04,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 92 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 398 Invalid, 0 Unknown, 599 Unchecked, 0.5s Time] [2022-11-16 12:21:04,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-11-16 12:21:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 576. [2022-11-16 12:21:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 566 states have (on average 2.3780918727915195) internal successors, (1346), 575 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1346 transitions. [2022-11-16 12:21:04,306 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1346 transitions. Word has length 14 [2022-11-16 12:21:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:04,306 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 1346 transitions. [2022-11-16 12:21:04,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1346 transitions. [2022-11-16 12:21:04,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:21:04,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:04,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:04,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:04,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:21:04,514 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:21:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash -935746573, now seen corresponding path program 2 times [2022-11-16 12:21:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:04,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172634844] [2022-11-16 12:21:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172634844] [2022-11-16 12:21:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172634844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290330400] [2022-11-16 12:21:05,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:21:05,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:05,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:05,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:05,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:21:05,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:21:05,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:21:05,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-16 12:21:05,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:05,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:05,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:05,841 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:05,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:21:05,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:21:05,875 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:21:05,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:21:06,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:06,119 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:21:06,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:21:06,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:21:06,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:06,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:21:06,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:21:06,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:21:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:06,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:06,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_795 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_795 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:21:06,632 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_795 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_795 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:06,761 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_792))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_792))) (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 .cse2 (+ (select .cse5 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:06,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_790 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_790)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_792))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_790 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_790)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_792))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:21:08,971 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_790 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_789 Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_789) .cse5 v_ArrVal_790)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_792))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_790 Int) (v_ArrVal_792 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_789 Int)) (<= (+ (* (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_789) .cse5 v_ArrVal_790)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_792))) (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_795) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:15,389 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:21:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:15,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290330400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:15,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:21:15,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-11-16 12:21:15,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161320953] [2022-11-16 12:21:15,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:15,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:21:15,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:15,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:21:15,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=277, Unknown=13, NotChecked=200, Total=600 [2022-11-16 12:21:15,489 INFO L87 Difference]: Start difference. First operand 576 states and 1346 transitions. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:16,679 INFO L93 Difference]: Finished difference Result 780 states and 1829 transitions. [2022-11-16 12:21:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:21:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 12:21:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:16,682 INFO L225 Difference]: With dead ends: 780 [2022-11-16 12:21:16,682 INFO L226 Difference]: Without dead ends: 780 [2022-11-16 12:21:16,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=161, Invalid=398, Unknown=13, NotChecked=240, Total=812 [2022-11-16 12:21:16,683 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 120 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1018 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:16,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 79 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 411 Invalid, 0 Unknown, 1018 Unchecked, 0.7s Time] [2022-11-16 12:21:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-16 12:21:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 559. [2022-11-16 12:21:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 549 states have (on average 2.411657559198543) internal successors, (1324), 558 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1324 transitions. [2022-11-16 12:21:16,699 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1324 transitions. Word has length 14 [2022-11-16 12:21:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:16,700 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1324 transitions. [2022-11-16 12:21:16,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1324 transitions. [2022-11-16 12:21:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:21:16,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:16,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:16,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:16,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:16,907 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:21:16,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -790713627, now seen corresponding path program 3 times [2022-11-16 12:21:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:16,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787023966] [2022-11-16 12:21:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:18,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787023966] [2022-11-16 12:21:18,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787023966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425397377] [2022-11-16 12:21:18,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:21:18,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:18,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:18,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:18,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:21:19,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:21:19,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:21:19,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-16 12:21:19,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:19,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:19,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:19,056 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:19,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-16 12:21:19,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:19,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:21:19,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:21:19,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-16 12:21:19,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:21:20,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-16 12:21:20,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:20,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:21:20,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:21:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:20,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:20,537 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_895 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_895 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-16 12:21:20,553 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_894 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_894) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_894 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_894) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:20,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_894 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_894) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_894 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_894) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:21:20,763 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_890 Int) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_890) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_894) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse4))))) (forall ((v_ArrVal_890 Int) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_890) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_894) |c_~#stored_elements~0.base| v_ArrVal_895) |c_~#queue~0.base|) .cse4)) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-16 12:21:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:23,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425397377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:23,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:21:23,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2022-11-16 12:21:23,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061399387] [2022-11-16 12:21:23,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:23,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 12:21:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:23,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 12:21:23,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=391, Unknown=11, NotChecked=180, Total=702 [2022-11-16 12:21:23,884 INFO L87 Difference]: Start difference. First operand 559 states and 1324 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:24,689 INFO L93 Difference]: Finished difference Result 560 states and 1327 transitions. [2022-11-16 12:21:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:21:24,695 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 12:21:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:24,700 INFO L225 Difference]: With dead ends: 560 [2022-11-16 12:21:24,700 INFO L226 Difference]: Without dead ends: 560 [2022-11-16 12:21:24,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=168, Invalid=539, Unknown=11, NotChecked=212, Total=930 [2022-11-16 12:21:24,703 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:24,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 330 Unchecked, 0.2s Time] [2022-11-16 12:21:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-16 12:21:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2022-11-16 12:21:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 548 states have (on average 2.4124087591240877) internal successors, (1322), 557 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1322 transitions. [2022-11-16 12:21:24,741 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1322 transitions. Word has length 14 [2022-11-16 12:21:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:24,741 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1322 transitions. [2022-11-16 12:21:24,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1322 transitions. [2022-11-16 12:21:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:21:24,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:24,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:24,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:24,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:24,950 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:21:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:24,951 INFO L85 PathProgramCache]: Analyzing trace with hash -790695957, now seen corresponding path program 4 times [2022-11-16 12:21:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:24,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222106116] [2022-11-16 12:21:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:26,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:26,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222106116] [2022-11-16 12:21:26,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222106116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:26,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000579993] [2022-11-16 12:21:26,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:21:26,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:26,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:26,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:26,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:21:26,271 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:21:26,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:21:26,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 12:21:26,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:26,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:26,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:26,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:26,333 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:26,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:21:26,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:26,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:21:26,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:21:26,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:21:26,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:26,761 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:21:26,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:21:26,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-16 12:21:27,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-16 12:21:27,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:27,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:21:27,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:27,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:21:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:27,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:27,575 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_990 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_990) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_990 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_990) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-16 12:21:27,592 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_989) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_990) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_989) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_990) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-16 12:21:27,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_989) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_990) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_989) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_990) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:34,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000579993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:34,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:21:34,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2022-11-16 12:21:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379443170] [2022-11-16 12:21:34,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:21:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:21:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=332, Unknown=11, NotChecked=120, Total=552 [2022-11-16 12:21:34,537 INFO L87 Difference]: Start difference. First operand 558 states and 1322 transitions. Second operand has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:35,377 INFO L93 Difference]: Finished difference Result 560 states and 1327 transitions. [2022-11-16 12:21:35,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:21:35,378 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 12:21:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:35,380 INFO L225 Difference]: With dead ends: 560 [2022-11-16 12:21:35,380 INFO L226 Difference]: Without dead ends: 560 [2022-11-16 12:21:35,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=143, Invalid=560, Unknown=11, NotChecked=156, Total=870 [2022-11-16 12:21:35,381 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:35,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 260 Unchecked, 0.2s Time] [2022-11-16 12:21:35,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-16 12:21:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 558. [2022-11-16 12:21:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 548 states have (on average 2.4124087591240877) internal successors, (1322), 557 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1322 transitions. [2022-11-16 12:21:35,397 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1322 transitions. Word has length 14 [2022-11-16 12:21:35,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:35,397 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1322 transitions. [2022-11-16 12:21:35,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1322 transitions. [2022-11-16 12:21:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:21:35,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:35,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:35,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:35,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-16 12:21:35,605 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:21:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1257408737, now seen corresponding path program 1 times [2022-11-16 12:21:35,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:35,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245437331] [2022-11-16 12:21:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:35,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245437331] [2022-11-16 12:21:36,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245437331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:36,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015539248] [2022-11-16 12:21:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:36,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:36,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:36,819 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:36,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:21:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 12:21:37,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:37,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:37,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:37,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:37,047 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:21:37,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-16 12:21:37,069 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:21:37,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:21:37,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-16 12:21:37,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:21:37,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-16 12:21:37,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:37,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-16 12:21:38,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:38,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-16 12:21:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:38,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:38,283 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1087 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1087) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1087 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1087) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:21:40,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1086 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1086) |c_~#stored_elements~0.base| v_ArrVal_1087) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1086 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1086) |c_~#stored_elements~0.base| v_ArrVal_1087) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-16 12:21:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:47,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015539248] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:47,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:21:47,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-11-16 12:21:47,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292346331] [2022-11-16 12:21:47,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:47,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:21:47,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:47,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:21:47,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=376, Unknown=23, NotChecked=86, Total=600 [2022-11-16 12:21:47,347 INFO L87 Difference]: Start difference. First operand 558 states and 1322 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:47,896 INFO L93 Difference]: Finished difference Result 576 states and 1378 transitions. [2022-11-16 12:21:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:21:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 12:21:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:47,898 INFO L225 Difference]: With dead ends: 576 [2022-11-16 12:21:47,898 INFO L226 Difference]: Without dead ends: 576 [2022-11-16 12:21:47,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=143, Invalid=492, Unknown=23, NotChecked=98, Total=756 [2022-11-16 12:21:47,899 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:47,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 208 Unchecked, 0.1s Time] [2022-11-16 12:21:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-11-16 12:21:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 559. [2022-11-16 12:21:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 549 states have (on average 2.411657559198543) internal successors, (1324), 558 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1324 transitions. [2022-11-16 12:21:47,915 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1324 transitions. Word has length 15 [2022-11-16 12:21:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:47,916 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1324 transitions. [2022-11-16 12:21:47,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:21:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1324 transitions. [2022-11-16 12:21:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:21:47,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:47,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:47,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:21:48,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:48,128 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:21:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1257670997, now seen corresponding path program 2 times [2022-11-16 12:21:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:48,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345469839] [2022-11-16 12:21:48,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:49,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345469839] [2022-11-16 12:21:49,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345469839] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:49,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918460392] [2022-11-16 12:21:49,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:21:49,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:49,327 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:49,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:21:49,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:21:49,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:21:49,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 12:21:49,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:49,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:49,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:21:49,613 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-16 12:21:49,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2022-11-16 12:21:49,636 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:21:49,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:21:49,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-16 12:21:49,975 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:21:49,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 12:21:50,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:21:50,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-16 12:21:50,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:21:50,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:21:50,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:21:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:50,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:50,990 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1184 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1184) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1184 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1184) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:21:51,004 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1183) |c_~#stored_elements~0.base| v_ArrVal_1184) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1183) |c_~#stored_elements~0.base| v_ArrVal_1184) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:21:51,027 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1183) |c_~#stored_elements~0.base| v_ArrVal_1184) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1183) |c_~#stored_elements~0.base| v_ArrVal_1184) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:21:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:21:59,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918460392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:59,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:21:59,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-16 12:21:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596158957] [2022-11-16 12:21:59,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:59,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 12:21:59,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 12:21:59,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=467, Unknown=14, NotChecked=144, Total=756 [2022-11-16 12:21:59,082 INFO L87 Difference]: Start difference. First operand 559 states and 1324 transitions. Second operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:00,737 INFO L93 Difference]: Finished difference Result 707 states and 1668 transitions. [2022-11-16 12:22:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:22:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 12:22:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:00,739 INFO L225 Difference]: With dead ends: 707 [2022-11-16 12:22:00,740 INFO L226 Difference]: Without dead ends: 707 [2022-11-16 12:22:00,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=226, Invalid=826, Unknown=16, NotChecked=192, Total=1260 [2022-11-16 12:22:00,741 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 139 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:00,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 89 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 284 Invalid, 0 Unknown, 648 Unchecked, 0.5s Time] [2022-11-16 12:22:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-11-16 12:22:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 560. [2022-11-16 12:22:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 550 states have (on average 2.4127272727272726) internal successors, (1327), 559 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1327 transitions. [2022-11-16 12:22:00,756 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1327 transitions. Word has length 15 [2022-11-16 12:22:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:00,756 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1327 transitions. [2022-11-16 12:22:00,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1327 transitions. [2022-11-16 12:22:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:22:00,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:00,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:00,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:00,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:00,963 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1258218767, now seen corresponding path program 3 times [2022-11-16 12:22:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:00,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24213207] [2022-11-16 12:22:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:02,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:02,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24213207] [2022-11-16 12:22:02,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24213207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:02,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300073082] [2022-11-16 12:22:02,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:22:02,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:02,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:02,115 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:02,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:22:02,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:22:02,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:02,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 12:22:02,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:02,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:02,427 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-16 12:22:02,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2022-11-16 12:22:02,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:02,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:22:02,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-16 12:22:02,865 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:22:02,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 12:22:03,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:22:03,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-16 12:22:03,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-16 12:22:03,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:03,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-16 12:22:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:03,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:04,316 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1280) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1280) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:22:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:09,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300073082] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:09,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:09,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2022-11-16 12:22:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249021029] [2022-11-16 12:22:09,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:09,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 12:22:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 12:22:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=488, Unknown=27, NotChecked=48, Total=702 [2022-11-16 12:22:09,502 INFO L87 Difference]: Start difference. First operand 560 states and 1327 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:10,000 INFO L93 Difference]: Finished difference Result 659 states and 1560 transitions. [2022-11-16 12:22:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:22:10,001 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 12:22:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:10,002 INFO L225 Difference]: With dead ends: 659 [2022-11-16 12:22:10,003 INFO L226 Difference]: Without dead ends: 659 [2022-11-16 12:22:10,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=167, Invalid=565, Unknown=28, NotChecked=52, Total=812 [2022-11-16 12:22:10,003 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:10,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 185 Unchecked, 0.2s Time] [2022-11-16 12:22:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-11-16 12:22:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 559. [2022-11-16 12:22:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 549 states have (on average 2.411657559198543) internal successors, (1324), 558 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1324 transitions. [2022-11-16 12:22:10,017 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1324 transitions. Word has length 15 [2022-11-16 12:22:10,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:10,018 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1324 transitions. [2022-11-16 12:22:10,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:10,018 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1324 transitions. [2022-11-16 12:22:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:22:10,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:10,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:10,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 12:22:10,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:10,225 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1574298217, now seen corresponding path program 4 times [2022-11-16 12:22:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:10,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478417330] [2022-11-16 12:22:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:12,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478417330] [2022-11-16 12:22:12,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478417330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:12,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288726767] [2022-11-16 12:22:12,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:22:12,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:12,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:12,039 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:12,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:22:12,232 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:22:12,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:12,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-16 12:22:12,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:12,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:12,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:12,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:12,316 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:22:12,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-16 12:22:12,350 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:12,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:22:12,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:12,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 12:22:12,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-16 12:22:12,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:22:13,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-16 12:22:13,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:13,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2022-11-16 12:22:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:13,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:13,643 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1376 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1376) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1376 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1376) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:22:18,718 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1369 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1355| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1369))) (let ((.cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1355| 4) |c_~#queue~0.offset|)) (.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1372 Int) (v_ArrVal_1371 Int) (v_ArrVal_1376 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_1371))) (store (store .cse1 .cse2 v_ArrVal_1372) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1376) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse5)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1355| (select .cse4 .cse3))))))) (forall ((v_ArrVal_1369 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1355| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1369))) (let ((.cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1355| 4) |c_~#queue~0.offset|)) (.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1372 Int) (v_ArrVal_1371 Int) (v_ArrVal_1376 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 .cse9 v_ArrVal_1371))) (store (store .cse7 .cse2 v_ArrVal_1372) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1376) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse9)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1355| (select .cse8 .cse3))))))))) is different from false [2022-11-16 12:22:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:18,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288726767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:18,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:18,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-11-16 12:22:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885717475] [2022-11-16 12:22:18,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:18,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:22:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:22:18,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=395, Unknown=16, NotChecked=86, Total=600 [2022-11-16 12:22:18,845 INFO L87 Difference]: Start difference. First operand 559 states and 1324 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:20,730 INFO L93 Difference]: Finished difference Result 571 states and 1354 transitions. [2022-11-16 12:22:20,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:22:20,730 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 12:22:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:20,732 INFO L225 Difference]: With dead ends: 571 [2022-11-16 12:22:20,732 INFO L226 Difference]: Without dead ends: 571 [2022-11-16 12:22:20,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=175, Invalid=686, Unknown=17, NotChecked=114, Total=992 [2022-11-16 12:22:20,733 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:20,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 256 Unchecked, 0.6s Time] [2022-11-16 12:22:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-11-16 12:22:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 566. [2022-11-16 12:22:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 556 states have (on average 2.406474820143885) internal successors, (1338), 565 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1338 transitions. [2022-11-16 12:22:20,747 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1338 transitions. Word has length 15 [2022-11-16 12:22:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:20,747 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 1338 transitions. [2022-11-16 12:22:20,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1338 transitions. [2022-11-16 12:22:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:22:20,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:20,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:20,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:20,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:20,954 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash -184360555, now seen corresponding path program 5 times [2022-11-16 12:22:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:20,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436883937] [2022-11-16 12:22:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:22,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:22,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436883937] [2022-11-16 12:22:22,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436883937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:22,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259110803] [2022-11-16 12:22:22,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:22:22,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:22,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:22,923 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:22,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:22:23,135 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:22:23,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:23,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-16 12:22:23,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:23,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:23,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:23,210 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-16 12:22:23,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2022-11-16 12:22:23,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:22:23,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:22:23,456 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:22:23,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 55 [2022-11-16 12:22:23,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2022-11-16 12:22:23,985 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:22:23,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 12:22:24,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:22:24,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-16 12:22:24,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:24,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:22:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:25,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:25,364 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1475) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1475) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:22:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:33,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259110803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:33,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:33,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2022-11-16 12:22:33,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169231098] [2022-11-16 12:22:33,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:33,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 12:22:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 12:22:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=596, Unknown=10, NotChecked=52, Total=812 [2022-11-16 12:22:33,762 INFO L87 Difference]: Start difference. First operand 566 states and 1338 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:34,454 INFO L93 Difference]: Finished difference Result 586 states and 1400 transitions. [2022-11-16 12:22:34,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:22:34,455 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 12:22:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:34,456 INFO L225 Difference]: With dead ends: 586 [2022-11-16 12:22:34,456 INFO L226 Difference]: Without dead ends: 586 [2022-11-16 12:22:34,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=196, Invalid=728, Unknown=10, NotChecked=58, Total=992 [2022-11-16 12:22:34,457 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:34,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 418 Unchecked, 0.2s Time] [2022-11-16 12:22:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-11-16 12:22:34,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 567. [2022-11-16 12:22:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 557 states have (on average 2.405745062836625) internal successors, (1340), 566 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1340 transitions. [2022-11-16 12:22:34,471 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1340 transitions. Word has length 15 [2022-11-16 12:22:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:34,471 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 1340 transitions. [2022-11-16 12:22:34,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1340 transitions. [2022-11-16 12:22:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:22:34,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:34,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:34,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:34,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 12:22:34,678 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1228863905, now seen corresponding path program 1 times [2022-11-16 12:22:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:34,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169858916] [2022-11-16 12:22:34,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:34,776 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-16 12:22:34,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:34,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169858916] [2022-11-16 12:22:34,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169858916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:34,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:34,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:22:34,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203481419] [2022-11-16 12:22:34,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:34,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:22:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:34,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:22:34,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:22:34,778 INFO L87 Difference]: Start difference. First operand 567 states and 1340 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:34,944 INFO L93 Difference]: Finished difference Result 579 states and 1348 transitions. [2022-11-16 12:22:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:22:34,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 12:22:34,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:34,946 INFO L225 Difference]: With dead ends: 579 [2022-11-16 12:22:34,946 INFO L226 Difference]: Without dead ends: 579 [2022-11-16 12:22:34,946 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-16 12:22:34,947 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:34,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:22:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-11-16 12:22:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 553. [2022-11-16 12:22:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 543 states have (on average 2.3996316758747698) internal successors, (1303), 552 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1303 transitions. [2022-11-16 12:22:34,960 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1303 transitions. Word has length 15 [2022-11-16 12:22:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:34,960 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 1303 transitions. [2022-11-16 12:22:34,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1303 transitions. [2022-11-16 12:22:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:22:34,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:34,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:34,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 12:22:34,962 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1029332007, now seen corresponding path program 6 times [2022-11-16 12:22:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:34,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932364651] [2022-11-16 12:22:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:37,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:37,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932364651] [2022-11-16 12:22:37,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932364651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:37,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906538935] [2022-11-16 12:22:37,220 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:22:37,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:37,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:37,223 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:37,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:22:37,494 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-16 12:22:37,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:37,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-16 12:22:37,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:37,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:37,571 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-16 12:22:37,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 39 [2022-11-16 12:22:37,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2022-11-16 12:22:37,601 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:22:37,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:22:37,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:22:37,774 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:22:37,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-11-16 12:22:37,785 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:22:38,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:22:38,109 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:22:38,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2022-11-16 12:22:38,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:22:38,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:22:38,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:22:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:38,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:39,086 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1605 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1605) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1605 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1605) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:22:39,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1601 Int) (v_ArrVal_1605 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1601) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1605) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1601 Int) (v_ArrVal_1605 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1601) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1605) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-16 12:22:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:43,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906538935] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:43,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:43,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2022-11-16 12:22:43,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511125989] [2022-11-16 12:22:43,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 12:22:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 12:22:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=490, Unknown=7, NotChecked=94, Total=702 [2022-11-16 12:22:43,980 INFO L87 Difference]: Start difference. First operand 553 states and 1303 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:46,480 INFO L93 Difference]: Finished difference Result 611 states and 1463 transitions. [2022-11-16 12:22:46,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:22:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 12:22:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:46,489 INFO L225 Difference]: With dead ends: 611 [2022-11-16 12:22:46,489 INFO L226 Difference]: Without dead ends: 611 [2022-11-16 12:22:46,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=206, Invalid=725, Unknown=7, NotChecked=118, Total=1056 [2022-11-16 12:22:46,490 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 156 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:46,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 106 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 398 Invalid, 0 Unknown, 610 Unchecked, 1.0s Time] [2022-11-16 12:22:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-16 12:22:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 543. [2022-11-16 12:22:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 533 states have (on average 2.403377110694184) internal successors, (1281), 542 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1281 transitions. [2022-11-16 12:22:46,504 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1281 transitions. Word has length 15 [2022-11-16 12:22:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:46,505 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 1281 transitions. [2022-11-16 12:22:46,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1281 transitions. [2022-11-16 12:22:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:22:46,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:46,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:46,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:22:46,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 12:22:46,713 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:46,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash 324930909, now seen corresponding path program 1 times [2022-11-16 12:22:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:46,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552323831] [2022-11-16 12:22:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:46,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552323831] [2022-11-16 12:22:46,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552323831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:46,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:46,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:22:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868824158] [2022-11-16 12:22:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:46,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:22:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:46,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:22:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:22:46,787 INFO L87 Difference]: Start difference. First operand 543 states and 1281 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:46,935 INFO L93 Difference]: Finished difference Result 364 states and 733 transitions. [2022-11-16 12:22:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:22:46,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 12:22:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:46,936 INFO L225 Difference]: With dead ends: 364 [2022-11-16 12:22:46,936 INFO L226 Difference]: Without dead ends: 362 [2022-11-16 12:22:46,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:22:46,937 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:46,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:22:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-16 12:22:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 354. [2022-11-16 12:22:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 344 states have (on average 2.0959302325581395) internal successors, (721), 353 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 721 transitions. [2022-11-16 12:22:46,946 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 721 transitions. Word has length 16 [2022-11-16 12:22:46,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:46,946 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 721 transitions. [2022-11-16 12:22:46,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 721 transitions. [2022-11-16 12:22:46,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:22:46,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:46,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:46,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 12:22:46,948 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 324886703, now seen corresponding path program 1 times [2022-11-16 12:22:46,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:46,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323787616] [2022-11-16 12:22:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:48,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:48,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323787616] [2022-11-16 12:22:48,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323787616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:48,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953330139] [2022-11-16 12:22:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:48,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:48,203 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:48,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:22:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:48,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-16 12:22:48,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:48,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:48,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:48,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:48,495 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:22:48,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:22:48,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:48,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:22:48,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 12:22:48,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:22:48,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:22:48,843 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:22:48,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:22:49,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-16 12:22:49,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-16 12:22:49,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:49,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:22:49,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:49,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:22:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:49,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:49,628 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1739 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1739) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1739 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1739) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-16 12:22:49,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1738) |c_~#stored_elements~0.base| v_ArrVal_1739) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1738) |c_~#stored_elements~0.base| v_ArrVal_1739) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:22:49,681 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1738) |c_~#stored_elements~0.base| v_ArrVal_1739) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1738) |c_~#stored_elements~0.base| v_ArrVal_1739) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:22:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:55,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953330139] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:55,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:55,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-11-16 12:22:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634717170] [2022-11-16 12:22:55,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:55,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:22:55,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:22:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=355, Unknown=13, NotChecked=126, Total=600 [2022-11-16 12:22:55,417 INFO L87 Difference]: Start difference. First operand 354 states and 721 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:56,118 INFO L93 Difference]: Finished difference Result 360 states and 734 transitions. [2022-11-16 12:22:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:22:56,119 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 12:22:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:56,120 INFO L225 Difference]: With dead ends: 360 [2022-11-16 12:22:56,120 INFO L226 Difference]: Without dead ends: 360 [2022-11-16 12:22:56,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=161, Invalid=540, Unknown=13, NotChecked=156, Total=870 [2022-11-16 12:22:56,121 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:56,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 274 Unchecked, 0.2s Time] [2022-11-16 12:22:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-16 12:22:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 356. [2022-11-16 12:22:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 346 states have (on average 2.0953757225433525) internal successors, (725), 355 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 725 transitions. [2022-11-16 12:22:56,129 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 725 transitions. Word has length 16 [2022-11-16 12:22:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:56,130 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 725 transitions. [2022-11-16 12:22:56,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:22:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 725 transitions. [2022-11-16 12:22:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:22:56,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:56,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:56,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-16 12:22:56,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:56,339 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:22:56,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:56,339 INFO L85 PathProgramCache]: Analyzing trace with hash 324961103, now seen corresponding path program 2 times [2022-11-16 12:22:56,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:56,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252107136] [2022-11-16 12:22:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:56,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:22:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252107136] [2022-11-16 12:22:57,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252107136] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:22:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490449404] [2022-11-16 12:22:57,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:22:57,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:57,550 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:57,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:22:57,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:22:57,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:57,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-16 12:22:57,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:57,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:57,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:22:57,828 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:22:57,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-11-16 12:22:57,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:57,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:57,872 INFO L321 Elim1Store]: treesize reduction 20, result has 20.0 percent of original size [2022-11-16 12:22:57,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 12:22:57,971 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-16 12:22:57,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-16 12:22:58,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-16 12:22:59,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-16 12:22:59,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-16 12:22:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:22:59,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:23:00,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-16 12:23:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:00,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:00,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1838 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1838 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:00,522 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837) |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837) |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:00,657 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837) |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837) |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:00,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1833 Int) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1833) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837) |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1833 Int) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1837 (Array Int Int))) (<= (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1833) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1837) |c_~#stored_elements~0.base| v_ArrVal_1838) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-16 12:23:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:05,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490449404] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:05,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:23:05,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-16 12:23:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041376717] [2022-11-16 12:23:05,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:05,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 12:23:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:05,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 12:23:05,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=439, Unknown=11, NotChecked=188, Total=756 [2022-11-16 12:23:05,674 INFO L87 Difference]: Start difference. First operand 356 states and 725 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:06,575 INFO L93 Difference]: Finished difference Result 360 states and 734 transitions. [2022-11-16 12:23:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:23:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 12:23:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:06,577 INFO L225 Difference]: With dead ends: 360 [2022-11-16 12:23:06,577 INFO L226 Difference]: Without dead ends: 360 [2022-11-16 12:23:06,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=160, Invalid=547, Unknown=11, NotChecked=212, Total=930 [2022-11-16 12:23:06,578 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 431 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:06,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 431 Unchecked, 0.2s Time] [2022-11-16 12:23:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-16 12:23:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 355. [2022-11-16 12:23:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 345 states have (on average 2.0956521739130434) internal successors, (723), 354 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 723 transitions. [2022-11-16 12:23:06,586 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 723 transitions. Word has length 16 [2022-11-16 12:23:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:06,587 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 723 transitions. [2022-11-16 12:23:06,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 723 transitions. [2022-11-16 12:23:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:23:06,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:06,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:06,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:23:06,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:06,794 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:23:06,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash 333091163, now seen corresponding path program 3 times [2022-11-16 12:23:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:06,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273536827] [2022-11-16 12:23:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:07,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273536827] [2022-11-16 12:23:07,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273536827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:23:07,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943061891] [2022-11-16 12:23:07,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:23:07,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:07,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:07,760 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:23:07,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:23:07,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:23:07,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:23:07,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-16 12:23:07,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:08,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:08,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:08,056 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:23:08,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:23:08,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:23:08,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:08,109 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-16 12:23:08,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 12:23:08,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:23:08,343 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:23:08,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:23:08,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:23:08,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:23:08,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:08,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:23:08,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:23:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:08,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:08,885 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1931 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1931 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:08,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:23:08,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:23:08,931 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:23:11,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1924 Int) (v_ArrVal_1926 Int) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1924))) (store (store .cse0 .cse1 v_ArrVal_1926) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1924 Int) (v_ArrVal_1926 Int) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1924))) (store (store .cse6 .cse1 v_ArrVal_1926) .cse2 (+ (select .cse6 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:13,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse4 .cse3))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1375| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1375| .cse0)) (forall ((v_ArrVal_1924 Int) (v_ArrVal_1926 Int) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1375| 4)) v_ArrVal_1924))) (store (store .cse1 .cse2 v_ArrVal_1926) .cse3 (+ (select .cse1 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1375| Int)) (or (forall ((v_ArrVal_1924 Int) (v_ArrVal_1926 Int) (v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1375| 4)) v_ArrVal_1924))) (store (store .cse5 .cse2 v_ArrVal_1926) .cse3 (+ (select .cse5 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1930) |c_~#stored_elements~0.base| v_ArrVal_1931) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1375| .cse0))))))) is different from false [2022-11-16 12:23:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 12:23:13,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943061891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:13,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:23:13,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-11-16 12:23:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100068318] [2022-11-16 12:23:13,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:13,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:23:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:13,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:23:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=255, Unknown=13, NotChecked=234, Total=600 [2022-11-16 12:23:13,725 INFO L87 Difference]: Start difference. First operand 355 states and 723 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:14,756 INFO L93 Difference]: Finished difference Result 479 states and 978 transitions. [2022-11-16 12:23:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:23:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 12:23:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:14,758 INFO L225 Difference]: With dead ends: 479 [2022-11-16 12:23:14,758 INFO L226 Difference]: Without dead ends: 479 [2022-11-16 12:23:14,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=109, Invalid=282, Unknown=13, NotChecked=246, Total=650 [2022-11-16 12:23:14,759 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 86 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:14,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 65 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 433 Invalid, 0 Unknown, 673 Unchecked, 0.7s Time] [2022-11-16 12:23:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-16 12:23:14,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 334. [2022-11-16 12:23:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 2.1018518518518516) internal successors, (681), 333 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 681 transitions. [2022-11-16 12:23:14,767 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 681 transitions. Word has length 16 [2022-11-16 12:23:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:14,768 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 681 transitions. [2022-11-16 12:23:14,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 681 transitions. [2022-11-16 12:23:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 12:23:14,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:14,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:14,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-16 12:23:14,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-16 12:23:14,974 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:23:14,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1989337795, now seen corresponding path program 1 times [2022-11-16 12:23:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:14,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127873175] [2022-11-16 12:23:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:14,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:15,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:15,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127873175] [2022-11-16 12:23:15,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127873175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:23:15,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172827570] [2022-11-16 12:23:15,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:15,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:15,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:15,996 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:23:16,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 12:23:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:16,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:23:16,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:16,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:16,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:16,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:16,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-16 12:23:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:16,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:16,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172827570] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:16,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:23:16,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2022-11-16 12:23:16,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197114570] [2022-11-16 12:23:16,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:16,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:23:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:23:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:23:16,732 INFO L87 Difference]: Start difference. First operand 334 states and 681 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:18,130 INFO L93 Difference]: Finished difference Result 892 states and 1815 transitions. [2022-11-16 12:23:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:23:18,131 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 12:23:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:18,133 INFO L225 Difference]: With dead ends: 892 [2022-11-16 12:23:18,134 INFO L226 Difference]: Without dead ends: 892 [2022-11-16 12:23:18,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-11-16 12:23:18,135 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 377 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:18,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 38 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:23:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-11-16 12:23:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 562. [2022-11-16 12:23:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 552 states have (on average 2.085144927536232) internal successors, (1151), 561 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1151 transitions. [2022-11-16 12:23:18,149 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1151 transitions. Word has length 19 [2022-11-16 12:23:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:18,149 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1151 transitions. [2022-11-16 12:23:18,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1151 transitions. [2022-11-16 12:23:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 12:23:18,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:18,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:18,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 12:23:18,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:18,356 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:23:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:18,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1364711956, now seen corresponding path program 1 times [2022-11-16 12:23:18,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:18,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892117232] [2022-11-16 12:23:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:18,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:18,968 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-16 12:23:18,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:18,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892117232] [2022-11-16 12:23:18,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892117232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:23:18,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864902418] [2022-11-16 12:23:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:18,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:18,970 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:23:18,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 12:23:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:19,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 12:23:19,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:19,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:23:19,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:19,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:23:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:23:19,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:19,643 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2110 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2110) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2110 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2110) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-16 12:23:19,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:19,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 12:23:19,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:19,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2022-11-16 12:23:19,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-16 12:23:19,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:23:19,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-16 12:23:19,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:23:19,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:19,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-16 12:23:20,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-16 12:23:20,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864902418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:20,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:23:20,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2022-11-16 12:23:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162118339] [2022-11-16 12:23:20,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:20,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:23:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:23:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=139, Unknown=1, NotChecked=24, Total=210 [2022-11-16 12:23:20,041 INFO L87 Difference]: Start difference. First operand 562 states and 1151 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:20,970 INFO L93 Difference]: Finished difference Result 768 states and 1578 transitions. [2022-11-16 12:23:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:23:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 12:23:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:20,975 INFO L225 Difference]: With dead ends: 768 [2022-11-16 12:23:20,975 INFO L226 Difference]: Without dead ends: 768 [2022-11-16 12:23:20,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=246, Unknown=1, NotChecked=34, Total=380 [2022-11-16 12:23:20,976 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 428 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:20,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 29 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 326 Invalid, 0 Unknown, 95 Unchecked, 0.6s Time] [2022-11-16 12:23:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-11-16 12:23:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 616. [2022-11-16 12:23:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 606 states have (on average 2.117161716171617) internal successors, (1283), 615 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1283 transitions. [2022-11-16 12:23:20,990 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1283 transitions. Word has length 21 [2022-11-16 12:23:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:20,990 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 1283 transitions. [2022-11-16 12:23:20,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1283 transitions. [2022-11-16 12:23:20,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 12:23:20,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:20,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-16 12:23:21,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 12:23:21,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:21,197 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:23:21,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash -536235030, now seen corresponding path program 2 times [2022-11-16 12:23:21,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:21,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339969837] [2022-11-16 12:23:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:21,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:22,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339969837] [2022-11-16 12:23:22,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339969837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:23:22,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83154961] [2022-11-16 12:23:22,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:23:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:22,805 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:23:22,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 12:23:23,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:23:23,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:23:23,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-16 12:23:23,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:23,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:23,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:23,133 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:23:23,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:23:23,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:23:23,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:23:23,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-16 12:23:23,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:23:23,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:23:23,513 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:23:23,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:23:23,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:23:23,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:23:23,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:23:24,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:23:24,090 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:23:24,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:23:24,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:23:24,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:23:24,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:23:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:23:24,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:24,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2222 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:24,587 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:23:24,602 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2222 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-16 12:23:24,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_2217))) (store (store .cse0 .cse1 v_ArrVal_2219) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_2217))) (store (store .cse6 .cse1 v_ArrVal_2219) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:33,200 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:23:33,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse1 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse4 .cse3))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse6 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse7 .cse3))))))))) is different from false [2022-11-16 12:23:33,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse1 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse4 .cse3))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse7 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse6 .cse3))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse8 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) is different from false [2022-11-16 12:23:33,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse1 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse4 .cse3))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse7 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse6 .cse3))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse8 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))))) is different from false [2022-11-16 12:23:35,879 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2210 Int)) (let ((.cse5 (store .cse9 .cse10 v_ArrVal_2210))) (let ((.cse8 (select .cse5 .cse7))) (or (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2211 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_2211) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse1 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse4 .cse3))))))) (= 400 .cse8))))) (forall ((v_ArrVal_2210 Int)) (let ((.cse15 (store .cse9 .cse10 v_ArrVal_2210))) (let ((.cse11 (select .cse15 .cse7))) (or (= 400 .cse11) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2211 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse6 v_ArrVal_2211) .cse7 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse12 (select .cse13 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse12 .cse3))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse14 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))))))) is different from false [2022-11-16 12:23:46,258 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:23:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-16 12:23:46,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83154961] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:46,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:23:46,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 14] total 34 [2022-11-16 12:23:46,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683524380] [2022-11-16 12:23:46,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:46,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 12:23:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:46,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 12:23:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=591, Unknown=17, NotChecked=472, Total=1260 [2022-11-16 12:23:46,444 INFO L87 Difference]: Start difference. First operand 616 states and 1283 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:23:53,574 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_2217))) (store (store .cse0 .cse1 v_ArrVal_2219) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)) (forall ((v_ArrVal_2210 Int)) (let ((.cse11 (store .cse3 .cse4 v_ArrVal_2210))) (let ((.cse12 (select .cse11 .cse2))) (or (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2211 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse11 .cse1 v_ArrVal_2211) .cse2 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse8 .cse9 v_ArrVal_2219) .cse5 (+ (select .cse8 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse10 .cse5))))))) (= 400 .cse12))))) (forall ((v_ArrVal_2210 Int)) (let ((.cse17 (store .cse3 .cse4 v_ArrVal_2210))) (let ((.cse13 (select .cse17 .cse2))) (or (= 400 .cse13) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2211 Int)) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse17 .cse1 v_ArrVal_2211) .cse2 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse14 (select .cse15 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse14 .cse5))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse16 .cse9 v_ArrVal_2219) .cse5 (+ (select .cse16 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse6)))))))))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse18 (store .cse3 .cse4 v_ArrVal_2217))) (store (store .cse18 .cse1 v_ArrVal_2219) .cse2 (+ (select .cse18 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:23:53,989 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse11 .cse12))) (let ((.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse0 1)))) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (or (= 400 .cse0) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse1 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse2 .cse3 v_ArrVal_2219) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse6)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse5 .cse4))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse9 (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse8 .cse4))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse10 .cse3 v_ArrVal_2219) .cse4 (+ (select .cse10 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse4) 4) 4) .cse6)) (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse4) 4)))))))) is different from false [2022-11-16 12:23:54,010 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1))))) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse0 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse1 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) .cse5)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse4 .cse3))))))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) 4) .cse5)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse8 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse7 .cse3))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse9 .cse2 v_ArrVal_2219) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2022-11-16 12:23:54,047 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_2222 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse2 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse3 .cse4 v_ArrVal_2219) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse6)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse5 .cse1))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| Int) (v_ArrVal_2215 (Array Int Int))) (let ((.cse8 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2215))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| (select .cse7 .cse1))) (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2217 Int) (v_ArrVal_2219 Int)) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1390| 4) |c_~#queue~0.offset|) v_ArrVal_2217))) (store (store .cse9 .cse4 v_ArrVal_2219) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_2222 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2222) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse6)))) is different from false [2022-11-16 12:24:15,327 WARN L233 SmtUtils]: Spent 16.16s on a formula simplification. DAG size of input: 49 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:24:15,483 INFO L93 Difference]: Finished difference Result 624 states and 1299 transitions. [2022-11-16 12:24:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 12:24:15,483 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 12:24:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:24:15,484 INFO L225 Difference]: With dead ends: 624 [2022-11-16 12:24:15,484 INFO L226 Difference]: Without dead ends: 624 [2022-11-16 12:24:15,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 12 IntricatePredicates, 2 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=299, Invalid=893, Unknown=46, NotChecked=924, Total=2162 [2022-11-16 12:24:15,485 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:24:15,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 496 Unchecked, 0.3s Time] [2022-11-16 12:24:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-16 12:24:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2022-11-16 12:24:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 612 states have (on average 2.1143790849673203) internal successors, (1294), 621 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:24:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1294 transitions. [2022-11-16 12:24:15,497 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1294 transitions. Word has length 21 [2022-11-16 12:24:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:24:15,498 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1294 transitions. [2022-11-16 12:24:15,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:24:15,498 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1294 transitions. [2022-11-16 12:24:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:24:15,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:24:15,499 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:15,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 12:24:15,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 12:24:15,707 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:24:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash -686771083, now seen corresponding path program 5 times [2022-11-16 12:24:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:15,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283550005] [2022-11-16 12:24:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:24:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:17,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283550005] [2022-11-16 12:24:17,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283550005] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:24:17,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848308659] [2022-11-16 12:24:17,469 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:24:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:24:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:24:17,470 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:24:17,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 12:24:17,736 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-16 12:24:17,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:24:17,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-16 12:24:17,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:24:17,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:17,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:17,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:17,791 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:24:17,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:24:17,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:24:17,830 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:24:17,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:24:18,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:18,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:24:18,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:24:18,248 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:24:18,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:24:18,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:24:18,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:24:18,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:18,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:24:18,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:24:18,816 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:24:18,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:24:18,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:24:19,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:24:19,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:19,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:24:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:24:19,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:24:19,346 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2338 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2338 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-16 12:24:19,360 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2338 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2338 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-16 12:24:19,375 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2338 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2338 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-16 12:24:19,403 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2335 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2335) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2335 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2335) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-16 12:24:26,132 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:24:26,160 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| Int) (v_ArrVal_2331 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2331))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2333 Int) (v_ArrVal_2335 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| 4) |c_~#queue~0.offset|) v_ArrVal_2333))) (store (store .cse1 .cse2 v_ArrVal_2335) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| (select .cse4 .cse3))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| Int) (v_ArrVal_2331 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2331))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2333 Int) (v_ArrVal_2335 Int)) (<= (+ (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| 4) |c_~#queue~0.offset|) v_ArrVal_2333))) (store (store .cse6 .cse2 v_ArrVal_2335) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| (select .cse7 .cse3))))))))) is different from false [2022-11-16 12:24:28,537 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| Int) (v_ArrVal_2331 (Array Int Int))) (let ((.cse2 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2331))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| (select .cse0 .cse1))) (forall ((v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2333 Int) (v_ArrVal_2335 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| 4) |c_~#queue~0.offset|) v_ArrVal_2333))) (store (store .cse3 .cse4 v_ArrVal_2335) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| Int) (v_ArrVal_2331 (Array Int Int))) (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_2331))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2333 Int) (v_ArrVal_2335 Int)) (<= (+ (* 4 (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| 4) |c_~#queue~0.offset|) v_ArrVal_2333))) (store (store .cse7 .cse4 v_ArrVal_2335) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2338) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1396| (select .cse8 .cse1))))))))) is different from false [2022-11-16 12:24:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:24:31,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848308659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:24:31,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:24:31,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 37 [2022-11-16 12:24:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169708029] [2022-11-16 12:24:31,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:24:31,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 12:24:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:24:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 12:24:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=888, Unknown=17, NotChecked=402, Total=1482 [2022-11-16 12:24:31,896 INFO L87 Difference]: Start difference. First operand 622 states and 1294 transitions. Second operand has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:24:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:24:38,499 INFO L93 Difference]: Finished difference Result 788 states and 1629 transitions. [2022-11-16 12:24:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:24:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:24:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:24:38,500 INFO L225 Difference]: With dead ends: 788 [2022-11-16 12:24:38,501 INFO L226 Difference]: Without dead ends: 788 [2022-11-16 12:24:38,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 4 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=305, Invalid=1682, Unknown=17, NotChecked=546, Total=2550 [2022-11-16 12:24:38,502 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1323 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:24:38,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 145 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 1323 Unchecked, 0.4s Time] [2022-11-16 12:24:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-16 12:24:38,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 678. [2022-11-16 12:24:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 668 states have (on average 2.1017964071856285) internal successors, (1404), 677 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:24:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1404 transitions. [2022-11-16 12:24:38,515 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1404 transitions. Word has length 22 [2022-11-16 12:24:38,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:24:38,516 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1404 transitions. [2022-11-16 12:24:38,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:24:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1404 transitions. [2022-11-16 12:24:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:24:38,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:24:38,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:24:38,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 12:24:38,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:24:38,723 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:24:38,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:24:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1065442219, now seen corresponding path program 6 times [2022-11-16 12:24:38,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:24:38,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5186372] [2022-11-16 12:24:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:24:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:24:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:24:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:24:40,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:24:40,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5186372] [2022-11-16 12:24:40,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5186372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:24:40,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625263556] [2022-11-16 12:24:40,442 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:24:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:24:40,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:24:40,443 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:24:40,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 12:24:40,807 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 12:24:40,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:24:40,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-16 12:24:40,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:24:40,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:40,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:40,878 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:24:40,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:24:40,899 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:24:40,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:24:40,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:24:41,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:24:41,202 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:24:41,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:24:41,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:24:41,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:24:41,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:24:41,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:24:41,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:24:41,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:24:41,925 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:24:41,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 34 [2022-11-16 12:24:42,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-16 12:24:42,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-16 12:24:42,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:24:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:24:42,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:24:42,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2454 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2454 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-16 12:24:42,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2454 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2454 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-16 12:24:46,418 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_2444 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2444))) (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select .cse8 .cse9))) (or (= 400 .cse0) (forall ((v_ArrVal_2447 (Array Int Int))) (let ((.cse1 (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2447))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (+ (* 4 (select .cse5 .cse4)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2451 Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2448 Int)) (<= (+ (* 4 (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2448))) (store (store .cse2 .cse3 v_ArrVal_2451) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse6)))))))))))) (forall ((v_ArrVal_2444 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2444))) (let ((.cse16 (select .cse15 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse10 (select .cse16 .cse9))) (or (= 400 .cse10) (forall ((v_ArrVal_2447 (Array Int Int))) (let ((.cse11 (store (store .cse15 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse16 .cse9 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2447))) (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (let ((.cse14 (+ (* 4 (select .cse13 .cse4)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2451 Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2448 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 v_ArrVal_2448))) (store (store .cse12 .cse3 v_ArrVal_2451) .cse4 (+ (select .cse12 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (not (<= 0 .cse14)))))))))))))) is different from false [2022-11-16 12:24:46,478 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2443 Int) (v_ArrVal_2444 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_2443)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2444))) (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select .cse8 .cse9))) (or (= 400 .cse0) (forall ((v_ArrVal_2447 (Array Int Int))) (let ((.cse1 (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2447))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (forall ((v_ArrVal_2451 Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2448 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2448))) (store (store .cse2 .cse3 v_ArrVal_2451) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse4) 4)))) (not (<= 0 .cse6)))))))))))) (forall ((v_ArrVal_2443 Int) (v_ArrVal_2444 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_2443)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2444))) (let ((.cse17 (select .cse16 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse18 (select .cse17 .cse9))) (or (forall ((v_ArrVal_2447 (Array Int Int))) (let ((.cse13 (store (store .cse16 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse17 .cse9 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_2447))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse15 .cse4) 4)))) (or (not (<= 0 .cse12)) (forall ((v_ArrVal_2451 Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2448 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2448))) (store (store .cse14 .cse3 v_ArrVal_2451) .cse4 (+ (select .cse14 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))))) (= 400 .cse18)))))))) is different from false [2022-11-16 12:24:47,669 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse12 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2441 Int) (v_ArrVal_2443 Int) (v_ArrVal_2444 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_2441) .cse12 v_ArrVal_2443)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2444))) (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select .cse8 .cse9))) (or (= 400 .cse0) (forall ((v_ArrVal_2447 (Array Int Int))) (let ((.cse1 (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2447))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (forall ((v_ArrVal_2451 Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2448 Int)) (<= (+ (* 4 (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2448))) (store (store .cse2 .cse3 v_ArrVal_2451) .cse4 (+ 1 (select .cse2 .cse4))))) |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse6)))))))))))) (forall ((v_ArrVal_2441 Int) (v_ArrVal_2443 Int) (v_ArrVal_2444 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 .cse11 v_ArrVal_2441) .cse12 v_ArrVal_2443)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2444))) (let ((.cse19 (select .cse18 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse13 (select .cse19 .cse9))) (or (= 400 .cse13) (forall ((v_ArrVal_2447 (Array Int Int))) (let ((.cse15 (store (store .cse18 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse19 .cse9 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2447))) (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (let ((.cse14 (+ |c_~#queue~0.offset| (* (select .cse17 .cse4) 4)))) (or (not (<= 0 .cse14)) (forall ((v_ArrVal_2451 Int) (v_ArrVal_2454 (Array Int Int)) (v_ArrVal_2448 Int)) (<= 0 (+ (* 4 (select (select (store (store .cse15 |c_~#queue~0.base| (let ((.cse16 (store .cse17 .cse14 v_ArrVal_2448))) (store (store .cse16 .cse3 v_ArrVal_2451) .cse4 (+ 1 (select .cse16 .cse4))))) |c_~#stored_elements~0.base| v_ArrVal_2454) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))))))))))))))) is different from false [2022-11-16 12:25:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:25:00,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625263556] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:25:00,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:25:00,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 38 [2022-11-16 12:25:00,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50476556] [2022-11-16 12:25:00,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:25:00,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 12:25:00,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:25:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 12:25:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=967, Unknown=37, NotChecked=350, Total=1560 [2022-11-16 12:25:00,443 INFO L87 Difference]: Start difference. First operand 678 states and 1404 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:13,759 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:25:24,334 WARN L233 SmtUtils]: Spent 10.40s on a formula simplification. DAG size of input: 100 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:25:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:32,079 INFO L93 Difference]: Finished difference Result 1007 states and 2064 transitions. [2022-11-16 12:25:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 12:25:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:25:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:32,081 INFO L225 Difference]: With dead ends: 1007 [2022-11-16 12:25:32,081 INFO L226 Difference]: Without dead ends: 1007 [2022-11-16 12:25:32,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=493, Invalid=2351, Unknown=38, NotChecked=540, Total=3422 [2022-11-16 12:25:32,083 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 299 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1781 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:32,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 156 Invalid, 2332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 532 Invalid, 0 Unknown, 1781 Unchecked, 0.9s Time] [2022-11-16 12:25:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2022-11-16 12:25:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 739. [2022-11-16 12:25:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 729 states have (on average 2.0754458161865568) internal successors, (1513), 738 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1513 transitions. [2022-11-16 12:25:32,098 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1513 transitions. Word has length 22 [2022-11-16 12:25:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:32,098 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 1513 transitions. [2022-11-16 12:25:32,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:25:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1513 transitions. [2022-11-16 12:25:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:25:32,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:32,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:32,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 12:25:32,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-16 12:25:32,306 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:25:32,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash 393124167, now seen corresponding path program 7 times [2022-11-16 12:25:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:32,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538716899] [2022-11-16 12:25:32,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:25:34,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538716899] [2022-11-16 12:25:34,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538716899] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:25:34,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728276966] [2022-11-16 12:25:34,057 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:25:34,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:25:34,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:25:34,058 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:25:34,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 12:25:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:25:34,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-16 12:25:34,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:25:34,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:34,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:34,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:34,360 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:25:34,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-16 12:25:34,387 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:25:34,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:25:34,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-16 12:25:34,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:25:34,676 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:25:34,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:25:34,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:25:34,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 12:25:35,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:35,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:25:35,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:35,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:25:35,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:25:35,333 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:25:35,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 34 [2022-11-16 12:25:35,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-16 12:25:35,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-16 12:25:35,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:25:35,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:25:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:25:35,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:25:35,985 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2570 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2570 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:25:36,000 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2570 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2570 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-16 12:25:36,016 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2570 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2570 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-16 12:25:36,044 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2567) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2567) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-16 12:25:44,386 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:25:44,880 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2562) |c_~#stored_elements~0.base| v_ArrVal_2563))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2565 Int) (v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_2565))) (store (store .cse2 .cse3 v_ArrVal_2567) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse4) 4))))))))) (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse8 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2562) |c_~#stored_elements~0.base| v_ArrVal_2563))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_2565 Int) (v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2565))) (store (store .cse9 .cse3 v_ArrVal_2567) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))))))) is different from false [2022-11-16 12:25:44,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))))) (and (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2562) |c_~#stored_elements~0.base| v_ArrVal_2563))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2565 Int) (v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_2565))) (store (store .cse2 .cse3 v_ArrVal_2567) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse8 (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2562) |c_~#stored_elements~0.base| v_ArrVal_2563))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_2565 Int) (v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2565))) (store (store .cse9 .cse3 v_ArrVal_2567) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))))))) is different from false [2022-11-16 12:26:04,588 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:26:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 12:26:04,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728276966] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:26:04,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:26:04,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 37 [2022-11-16 12:26:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406860606] [2022-11-16 12:26:04,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:26:04,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 12:26:04,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:26:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 12:26:04,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=872, Unknown=29, NotChecked=402, Total=1482 [2022-11-16 12:26:04,793 INFO L87 Difference]: Start difference. First operand 739 states and 1513 transitions. Second operand has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:26:37,977 WARN L233 SmtUtils]: Spent 10.21s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:27:00,599 WARN L233 SmtUtils]: Spent 12.65s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:27:00,625 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse14 .cse15))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse14 .cse15 (+ .cse2 1))))) (let ((.cse0 (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse11 (store (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2562) |c_~#stored_elements~0.base| v_ArrVal_2563))) (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (let ((.cse10 (+ |c_~#queue~0.offset| (* (select .cse13 .cse7) 4)))) (or (not (<= 0 .cse10)) (forall ((v_ArrVal_2565 Int) (v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2565))) (store (store .cse12 .cse6 v_ArrVal_2567) .cse7 (+ (select .cse12 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse7)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) (.cse1 (forall ((v_ArrVal_2563 (Array Int Int)) (v_ArrVal_2562 (Array Int Int))) (let ((.cse4 (store (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2562) |c_~#stored_elements~0.base| v_ArrVal_2563))) (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (+ |c_~#queue~0.offset| (* (select .cse8 .cse7) 4)))) (or (not (<= 0 .cse3)) (forall ((v_ArrVal_2565 Int) (v_ArrVal_2567 Int) (v_ArrVal_2570 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse8 .cse3 v_ArrVal_2565))) (store (store .cse5 .cse6 v_ArrVal_2567) .cse7 (+ (select .cse5 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2570) |c_~#queue~0.base|) .cse7)) |c_~#queue~0.offset|)))))))))) (and .cse0 (or (and .cse0 .cse1) (= 400 .cse2)) .cse1))))) is different from false [2022-11-16 12:27:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:05,556 INFO L93 Difference]: Finished difference Result 951 states and 1876 transitions. [2022-11-16 12:27:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 12:27:05,557 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:27:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:05,558 INFO L225 Difference]: With dead ends: 951 [2022-11-16 12:27:05,559 INFO L226 Difference]: Without dead ends: 951 [2022-11-16 12:27:05,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 20 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 89.4s TimeCoverageRelationStatistics Valid=518, Invalid=2818, Unknown=114, NotChecked=840, Total=4290 [2022-11-16 12:27:05,560 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 980 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:05,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 96 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 441 Invalid, 0 Unknown, 980 Unchecked, 0.8s Time] [2022-11-16 12:27:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-11-16 12:27:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 830. [2022-11-16 12:27:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 820 states have (on average 2.067073170731707) internal successors, (1695), 829 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:27:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1695 transitions. [2022-11-16 12:27:05,574 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1695 transitions. Word has length 22 [2022-11-16 12:27:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:05,575 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1695 transitions. [2022-11-16 12:27:05,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:27:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1695 transitions. [2022-11-16 12:27:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:27:05,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:05,576 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:05,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:05,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-16 12:27:05,782 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:27:05,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1169925361, now seen corresponding path program 8 times [2022-11-16 12:27:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:27:05,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700452425] [2022-11-16 12:27:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:27:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:27:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:27:08,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700452425] [2022-11-16 12:27:08,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700452425] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:27:08,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505573397] [2022-11-16 12:27:08,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:27:08,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:27:08,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:27:08,518 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:27:08,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-16 12:27:08,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:27:08,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:27:08,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-16 12:27:08,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:08,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:08,875 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-16 12:27:08,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 39 [2022-11-16 12:27:08,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2022-11-16 12:27:08,908 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:27:08,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:27:08,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 12:27:09,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:27:09,264 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:27:09,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2022-11-16 12:27:09,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:27:09,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-16 12:27:09,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:27:09,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:27:09,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-16 12:27:10,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:27:10,172 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 12:27:10,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-16 12:27:10,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-16 12:27:10,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-16 12:27:10,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 12:27:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:27:10,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:11,299 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2686 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2686 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-16 12:27:20,314 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ (select .cse8 .cse9) 1)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse3 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse4 (store (select .cse3 |c_~#queue~0.base|) .cse0 v_ArrVal_2681))) (let ((.cse2 (select .cse4 .cse6))) (or (not (<= 0 .cse0)) (< .cse1 v_ArrVal_2677) (= 400 .cse2) (<= (+ (* 4 (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2683) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse6)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse7 |c_~#queue~0.base|) .cse6))))))))) (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse11 (store .cse14 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse12 (store (select .cse11 |c_~#queue~0.base|) .cse10 v_ArrVal_2681))) (let ((.cse13 (select .cse12 .cse6))) (or (not (<= 0 .cse10)) (<= 0 (+ (* 4 (select (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse5 v_ArrVal_2683) .cse6 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse6)) |c_~#queue~0.offset|)) (< .cse1 v_ArrVal_2677) (= 400 .cse13) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse14 |c_~#queue~0.base|) .cse6)))))))))))) is different from false [2022-11-16 12:27:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 12:27:27,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505573397] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:27:27,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:27:27,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 17] total 40 [2022-11-16 12:27:27,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394164497] [2022-11-16 12:27:27,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:27,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 12:27:27,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:27:27,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 12:27:27,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1346, Unknown=37, NotChecked=154, Total=1722 [2022-11-16 12:27:27,341 INFO L87 Difference]: Start difference. First operand 830 states and 1695 transitions. Second operand has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:27:53,806 WARN L233 SmtUtils]: Spent 21.62s on a formula simplification. DAG size of input: 202 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:28:48,467 WARN L233 SmtUtils]: Spent 15.26s on a formula simplification. DAG size of input: 164 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:28:52,000 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse14 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse12 .cse14))) (let ((.cse11 (+ .cse4 1)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse20 (= 400 .cse4)) (.cse0 (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse47 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse12 .cse14 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse45 (store .cse47 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse43 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse46 (store (select .cse45 |c_~#queue~0.base|) .cse43 v_ArrVal_2681))) (let ((.cse44 (select .cse46 .cse2))) (or (not (<= 0 .cse43)) (< .cse11 v_ArrVal_2677) (= 400 .cse44) (<= (+ (* 4 (select (select (store (store .cse45 |c_~#queue~0.base| (store (store .cse46 .cse7 v_ArrVal_2683) .cse2 (+ .cse44 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset| 4) .cse3) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse47 |c_~#queue~0.base|) .cse2)))))))))) (.cse1 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse12 .cse14 .cse11))) (.cse37 (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse42 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse12 .cse14 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse39 (store .cse42 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse38 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse40 (store (select .cse39 |c_~#queue~0.base|) .cse38 v_ArrVal_2681))) (let ((.cse41 (select .cse40 .cse2))) (or (not (<= 0 .cse38)) (<= 0 (+ (* 4 (select (select (store (store .cse39 |c_~#queue~0.base| (store (store .cse40 .cse7 v_ArrVal_2683) .cse2 (+ .cse41 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2)) |c_~#queue~0.offset|)) (< .cse11 v_ArrVal_2677) (= 400 .cse41) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse42 |c_~#queue~0.base|) .cse2))))))))))) (and .cse0 (forall ((v_ArrVal_2686 (Array Int Int))) (<= (+ (* (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse3)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (<= (+ (* .cse4 4) 8) .cse3) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (= |c_~#queue~0.offset| 0) (<= 1 .cse4) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (or (let ((.cse13 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2675 Int) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_2675) .cse14 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse5 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse6 (store (select .cse5 |c_~#queue~0.base|) .cse9 v_ArrVal_2681))) (let ((.cse8 (select .cse6 .cse2))) (or (<= (+ (* (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2683) .cse2 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse3) (not (<= 0 .cse9)) (= 400 .cse8) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse10 |c_~#queue~0.base|) .cse2))) (< .cse11 v_ArrVal_2677))))))) (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2675 Int) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse12 .cse13 v_ArrVal_2675) .cse14 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse18 (store .cse17 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse15 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse19 (store (select .cse18 |c_~#queue~0.base|) .cse15 v_ArrVal_2681))) (let ((.cse16 (select .cse19 .cse2))) (or (not (<= 0 .cse15)) (= 400 .cse16) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse17 |c_~#queue~0.base|) .cse2))) (< .cse11 v_ArrVal_2677) (<= 0 (+ (* (select (select (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse7 v_ArrVal_2683) .cse2 (+ .cse16 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|)))))))))) .cse20) (or (not (<= (+ |c_~#queue~0.offset| 1612) .cse3)) (let ((.cse28 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse29 (select .cse28 .cse2))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1416| Int)) (or (forall ((v_ArrVal_2673 Int)) (let ((.cse27 (store .cse28 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1416| 4)) v_ArrVal_2673))) (let ((.cse21 (select .cse27 .cse2))) (or (= 400 .cse21) (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2675 Int) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse24 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse27 .cse7 v_ArrVal_2675) .cse2 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse25 (store .cse24 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse23 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse26 (store (select .cse25 |c_~#queue~0.base|) .cse23 v_ArrVal_2681))) (let ((.cse22 (select .cse26 .cse2))) (or (< (+ .cse21 1) v_ArrVal_2677) (= 400 .cse22) (not (<= 0 .cse23)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse24 |c_~#queue~0.base|) .cse2))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse7 v_ArrVal_2683) .cse2 (+ .cse22 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2)) 4) .cse3))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1416| .cse29)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1416| Int)) (or (forall ((v_ArrVal_2673 Int)) (let ((.cse36 (store .cse28 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1416| 4)) v_ArrVal_2673))) (let ((.cse30 (select .cse36 .cse2))) (or (= 400 .cse30) (forall ((v_ArrVal_2681 Int) (v_ArrVal_2679 (Array Int Int)) (v_ArrVal_2678 (Array Int Int)) (v_ArrVal_2683 Int) (v_ArrVal_2686 (Array Int Int)) (v_ArrVal_2675 Int) (v_ArrVal_2677 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| Int)) (let ((.cse33 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse36 .cse7 v_ArrVal_2675) .cse2 v_ArrVal_2677)) |c_~#stored_elements~0.base| v_ArrVal_2678))) (let ((.cse34 (store .cse33 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2679)) (.cse32 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| 4)))) (let ((.cse35 (store (select .cse34 |c_~#queue~0.base|) .cse32 v_ArrVal_2681))) (let ((.cse31 (select .cse35 .cse2))) (or (< (+ .cse30 1) v_ArrVal_2677) (= 400 .cse31) (not (<= 0 .cse32)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1414| (select (select .cse33 |c_~#queue~0.base|) .cse2))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store .cse34 |c_~#queue~0.base| (store (store .cse35 .cse7 v_ArrVal_2683) .cse2 (+ .cse31 1))) |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2)))))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1416| .cse29)))))))) (or .cse20 (and .cse0 .cse37)) (forall ((v_ArrVal_2686 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse1 |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) .cse37))))) is different from false [2022-11-16 12:29:04,489 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 102 DAG size of output: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:30:25,184 WARN L233 SmtUtils]: Spent 10.52s on a formula simplification. DAG size of input: 83 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:30:48,449 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 75 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:31:00,818 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 89 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:31:14,277 WARN L233 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 128 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:31:23,686 WARN L233 SmtUtils]: Spent 8.53s on a formula simplification. DAG size of input: 98 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:31:35,315 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse5 .cse6))) (let ((.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 (+ .cse2 1)))) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (forall ((v_ArrVal_2686 (Array Int Int))) (<= (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))) (.cse1 (forall ((v_ArrVal_2686 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_2686) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) (and .cse0 .cse1 (or (and .cse0 .cse1) (= 400 .cse2))))))) is different from false [2022-11-16 12:31:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:31:35,610 INFO L93 Difference]: Finished difference Result 1134 states and 2269 transitions. [2022-11-16 12:31:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 12:31:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:31:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:31:35,612 INFO L225 Difference]: With dead ends: 1134 [2022-11-16 12:31:35,612 INFO L226 Difference]: Without dead ends: 1134 [2022-11-16 12:31:35,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 23 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 263.6s TimeCoverageRelationStatistics Valid=751, Invalid=4205, Unknown=172, NotChecked=572, Total=5700 [2022-11-16 12:31:35,614 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 477 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2776 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:31:35,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 208 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 577 Invalid, 0 Unknown, 2776 Unchecked, 1.5s Time] [2022-11-16 12:31:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-11-16 12:31:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 835. [2022-11-16 12:31:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 825 states have (on average 2.0715151515151513) internal successors, (1709), 834 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:31:35,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1709 transitions. [2022-11-16 12:31:35,632 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1709 transitions. Word has length 22 [2022-11-16 12:31:35,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:31:35,632 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1709 transitions. [2022-11-16 12:31:35,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:31:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1709 transitions. [2022-11-16 12:31:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:31:35,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:31:35,634 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 12:31:35,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-16 12:31:35,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-16 12:31:35,840 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-16 12:31:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:31:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 411530449, now seen corresponding path program 9 times [2022-11-16 12:31:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:31:35,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589628988] [2022-11-16 12:31:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:31:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:31:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:31:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:31:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:31:37,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589628988] [2022-11-16 12:31:37,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589628988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:31:37,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233550863] [2022-11-16 12:31:37,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:31:37,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:31:37,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:31:37,689 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:31:37,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c150d7fa-0d4e-4453-b62f-a82f490bd55b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 12:31:38,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:31:38,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:31:38,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-16 12:31:38,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:31:38,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:31:38,230 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-16 12:31:38,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2022-11-16 12:31:38,255 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:31:38,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 12:31:38,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-16 12:31:38,619 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:31:38,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 12:31:38,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-11-16 12:31:38,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 12:31:39,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2022-11-16 12:31:39,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-16 12:31:39,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2022-11-16 12:31:39,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 95 [2022-11-16 12:31:39,631 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 12:31:39,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 12:31:40,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-16 12:31:40,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:31:40,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2022-11-16 12:31:40,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2022-11-16 12:31:41,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-16 12:31:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:31:41,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:31:52,153 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:31:58,535 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:32:26,034 WARN L233 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:32:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:32:26,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233550863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:32:26,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:32:26,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 16] total 40 [2022-11-16 12:32:26,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238219896] [2022-11-16 12:32:26,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:32:26,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 12:32:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:26,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 12:32:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1384, Unknown=37, NotChecked=0, Total=1722 [2022-11-16 12:32:26,355 INFO L87 Difference]: Start difference. First operand 835 states and 1709 transitions. Second operand has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:57,459 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 77 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:33:10,209 WARN L233 SmtUtils]: Spent 11.32s on a formula simplification. DAG size of input: 258 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:33:49,625 WARN L233 SmtUtils]: Spent 28.73s on a formula simplification. DAG size of input: 252 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:34:34,875 WARN L233 SmtUtils]: Spent 15.81s on a formula simplification. DAG size of input: 185 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)