./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-8393723 [2022-11-18 20:02:15,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:02:15,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:02:15,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:02:15,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:02:15,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:02:15,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:02:15,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:02:15,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:02:15,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:02:15,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:02:15,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:02:15,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:02:15,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:02:15,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:02:15,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:02:15,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:02:15,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:02:15,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:02:15,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:02:15,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:02:15,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:02:15,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:02:15,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:02:15,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:02:15,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:02:15,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:02:15,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:02:15,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:02:15,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:02:15,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:02:15,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:02:15,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:02:15,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:02:15,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:02:15,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:02:15,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:02:15,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:02:15,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:02:15,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:02:15,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:02:15,189 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:02:15,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:02:15,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:02:15,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:02:15,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:02:15,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:02:15,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:02:15,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:02:15,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:02:15,229 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:02:15,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:02:15,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:02:15,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:02:15,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:02:15,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:02:15,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:02:15,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:02:15,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:02:15,232 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:02:15,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:02:15,232 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:02:15,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:02:15,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:02:15,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:02:15,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:02:15,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:02:15,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:02:15,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:02:15,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:02:15,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:02:15,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:02:15,236 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_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-18 20:02:15,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:02:15,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:02:15,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:02:15,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:02:15,568 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:02:15,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-18 20:02:15,642 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/data/73ef18bc4/e3fd13e3db874c86b87749c305b6303e/FLAG0c711da58 [2022-11-18 20:02:16,198 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:02:16,199 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-18 20:02:16,223 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/data/73ef18bc4/e3fd13e3db874c86b87749c305b6303e/FLAG0c711da58 [2022-11-18 20:02:16,461 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/data/73ef18bc4/e3fd13e3db874c86b87749c305b6303e [2022-11-18 20:02:16,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:02:16,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:02:16,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:02:16,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:02:16,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:02:16,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:02:16" (1/1) ... [2022-11-18 20:02:16,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58770079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:16, skipping insertion in model container [2022-11-18 20:02:16,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:02:16" (1/1) ... [2022-11-18 20:02:16,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:02:16,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:02:17,258 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-18 20:02:17,267 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-18 20:02:17,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:02:17,293 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:02:17,364 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-18 20:02:17,376 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-18 20:02:17,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:02:17,458 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:02:17,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17 WrapperNode [2022-11-18 20:02:17,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:02:17,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:02:17,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:02:17,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:02:17,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,544 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-18 20:02:17,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:02:17,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:02:17,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:02:17,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:02:17,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,602 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:02:17,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:02:17,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:02:17,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:02:17,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (1/1) ... [2022-11-18 20:02:17,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:02:17,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:17,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:02:17,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:02:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-18 20:02:17,693 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-18 20:02:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-18 20:02:17,693 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-18 20:02:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:02:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:02:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:02:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:02:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 20:02:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:02:17,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:02:17,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:02:17,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:02:17,700 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:02:17,855 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:02:17,857 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:02:18,563 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:02:18,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:02:18,575 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:02:18,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:02:18 BoogieIcfgContainer [2022-11-18 20:02:18,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:02:18,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:02:18,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:02:18,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:02:18,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:02:16" (1/3) ... [2022-11-18 20:02:18,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2058aa37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:02:18, skipping insertion in model container [2022-11-18 20:02:18,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:02:17" (2/3) ... [2022-11-18 20:02:18,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2058aa37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:02:18, skipping insertion in model container [2022-11-18 20:02:18,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:02:18" (3/3) ... [2022-11-18 20:02:18,590 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-18 20:02:18,616 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:02:18,616 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-18 20:02:18,617 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:02:18,835 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:02:18,879 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:02:18,897 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-18 20:02:18,902 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-18 20:02:18,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-18 20:02:19,091 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-18 20:02:19,092 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:02:19,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 289 events. 13/289 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 677 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 190. Up to 3 conditions per place. [2022-11-18 20:02:19,119 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-18 20:02:44,152 INFO L134 LiptonReduction]: Checked pairs total: 60988 [2022-11-18 20:02:44,152 INFO L136 LiptonReduction]: Total number of compositions: 455 [2022-11-18 20:02:44,160 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-18 20:02:44,402 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-18 20:02:44,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:02:44,445 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;@6b30b545, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:02:44,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-18 20:02:44,465 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-18 20:02:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:02:44,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:44,472 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:02:44,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-18 20:02:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:44,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642483288] [2022-11-18 20:02:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:44,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:44,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642483288] [2022-11-18 20:02:44,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642483288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:44,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:44,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:02:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901966773] [2022-11-18 20:02:44,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:44,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:02:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:44,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:02:44,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:02:44,703 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-18 20:02:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:44,936 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-18 20:02:44,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:02:44,939 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-18 20:02:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:44,989 INFO L225 Difference]: With dead ends: 2668 [2022-11-18 20:02:44,989 INFO L226 Difference]: Without dead ends: 2668 [2022-11-18 20:02:44,990 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-18 20:02:44,996 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-18 20:02:45,002 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-18 20:02:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-18 20:02:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-18 20:02:45,181 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-18 20:02:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-18 20:02:45,204 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-18 20:02:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:45,205 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-18 20:02:45,206 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-18 20:02:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-18 20:02:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:02:45,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:45,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:02:45,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:02:45,209 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1276633, now seen corresponding path program 1 times [2022-11-18 20:02:45,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:45,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522087238] [2022-11-18 20:02:45,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:45,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522087238] [2022-11-18 20:02:45,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522087238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:45,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:45,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636936459] [2022-11-18 20:02:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:45,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:45,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:45,549 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-18 20:02:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:45,704 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-18 20:02:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:45,705 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-18 20:02:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:45,723 INFO L225 Difference]: With dead ends: 2618 [2022-11-18 20:02:45,724 INFO L226 Difference]: Without dead ends: 2618 [2022-11-18 20:02:45,724 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-18 20:02:45,725 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-18 20:02:45,726 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-18 20:02:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-18 20:02:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-18 20:02:45,804 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-18 20:02:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-18 20:02:45,818 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-18 20:02:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:45,820 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-18 20:02:45,820 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-18 20:02:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-18 20:02:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:02:45,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:45,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:02:45,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:02:45,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1276634, now seen corresponding path program 1 times [2022-11-18 20:02:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:45,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151064501] [2022-11-18 20:02:45,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:45,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:45,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151064501] [2022-11-18 20:02:45,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151064501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:45,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:45,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728653351] [2022-11-18 20:02:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:45,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:45,972 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-18 20:02:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:46,133 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-18 20:02:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:46,134 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-18 20:02:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:46,153 INFO L225 Difference]: With dead ends: 2568 [2022-11-18 20:02:46,153 INFO L226 Difference]: Without dead ends: 2568 [2022-11-18 20:02:46,154 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-18 20:02:46,158 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-18 20:02:46,160 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-18 20:02:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-18 20:02:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-18 20:02:46,252 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-18 20:02:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-18 20:02:46,267 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-18 20:02:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:46,267 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-18 20:02:46,268 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-18 20:02:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-18 20:02:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:02:46,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:46,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:02:46,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:02:46,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:46,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811491, now seen corresponding path program 1 times [2022-11-18 20:02:46,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:46,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564270509] [2022-11-18 20:02:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:46,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564270509] [2022-11-18 20:02:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564270509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:46,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:46,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121753096] [2022-11-18 20:02:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:46,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:46,682 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-18 20:02:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:46,827 INFO L93 Difference]: Finished difference Result 2196 states and 6425 transitions. [2022-11-18 20:02:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:46,828 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-18 20:02:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:46,843 INFO L225 Difference]: With dead ends: 2196 [2022-11-18 20:02:46,843 INFO L226 Difference]: Without dead ends: 2196 [2022-11-18 20:02:46,844 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-18 20:02:46,846 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:46,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2022-11-18 20:02:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2022-11-18 20:02:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2007 states have (on average 3.201295465869457) internal successors, (6425), 2195 states have internal predecessors, (6425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 6425 transitions. [2022-11-18 20:02:46,925 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 6425 transitions. Word has length 5 [2022-11-18 20:02:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:46,925 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 6425 transitions. [2022-11-18 20:02:46,926 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-18 20:02:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 6425 transitions. [2022-11-18 20:02:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:02:46,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:46,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:02:46,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:02:46,928 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-18 20:02:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811492, now seen corresponding path program 1 times [2022-11-18 20:02:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:46,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515537592] [2022-11-18 20:02:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:47,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515537592] [2022-11-18 20:02:47,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515537592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:47,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:47,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443006429] [2022-11-18 20:02:47,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:47,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:47,085 INFO L87 Difference]: Start difference. First operand 2196 states and 6425 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-18 20:02:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:47,197 INFO L93 Difference]: Finished difference Result 1930 states and 5670 transitions. [2022-11-18 20:02:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:47,198 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-18 20:02:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:47,212 INFO L225 Difference]: With dead ends: 1930 [2022-11-18 20:02:47,212 INFO L226 Difference]: Without dead ends: 1930 [2022-11-18 20:02:47,213 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-18 20:02:47,213 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:47,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2022-11-18 20:02:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2022-11-18 20:02:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1804 states have (on average 3.1430155210643016) internal successors, (5670), 1929 states have internal predecessors, (5670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5670 transitions. [2022-11-18 20:02:47,278 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5670 transitions. Word has length 5 [2022-11-18 20:02:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:47,278 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 5670 transitions. [2022-11-18 20:02:47,278 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-18 20:02:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5670 transitions. [2022-11-18 20:02:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:02:47,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:47,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:02:47,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:02:47,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811565, now seen corresponding path program 1 times [2022-11-18 20:02:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:47,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116773702] [2022-11-18 20:02:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:47,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116773702] [2022-11-18 20:02:47,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116773702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:47,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:47,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:47,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921827800] [2022-11-18 20:02:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:47,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:47,672 INFO L87 Difference]: Start difference. First operand 1930 states and 5670 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-18 20:02:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:47,808 INFO L93 Difference]: Finished difference Result 1936 states and 5683 transitions. [2022-11-18 20:02:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:47,809 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-18 20:02:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:47,823 INFO L225 Difference]: With dead ends: 1936 [2022-11-18 20:02:47,824 INFO L226 Difference]: Without dead ends: 1936 [2022-11-18 20:02:47,824 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-18 20:02:47,825 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:47,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-11-18 20:02:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1931. [2022-11-18 20:02:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1805 states have (on average 3.1429362880886424) internal successors, (5673), 1930 states have internal predecessors, (5673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5673 transitions. [2022-11-18 20:02:47,890 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 5673 transitions. Word has length 5 [2022-11-18 20:02:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:47,890 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 5673 transitions. [2022-11-18 20:02:47,891 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-18 20:02:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 5673 transitions. [2022-11-18 20:02:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:02:47,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:47,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:02:47,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:02:47,892 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-18 20:02:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1226869626, now seen corresponding path program 1 times [2022-11-18 20:02:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:47,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796812028] [2022-11-18 20:02:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:47,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:47,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:47,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796812028] [2022-11-18 20:02:47,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796812028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:47,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:47,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350784113] [2022-11-18 20:02:47,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:47,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:47,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:47,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:47,944 INFO L87 Difference]: Start difference. First operand 1931 states and 5673 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-18 20:02:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:48,056 INFO L93 Difference]: Finished difference Result 1471 states and 4187 transitions. [2022-11-18 20:02:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:48,057 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-18 20:02:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:48,067 INFO L225 Difference]: With dead ends: 1471 [2022-11-18 20:02:48,067 INFO L226 Difference]: Without dead ends: 1471 [2022-11-18 20:02:48,067 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-18 20:02:48,068 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:48,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2022-11-18 20:02:48,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2022-11-18 20:02:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1387 states have (on average 3.0187454938716654) internal successors, (4187), 1470 states have internal predecessors, (4187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4187 transitions. [2022-11-18 20:02:48,115 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 4187 transitions. Word has length 5 [2022-11-18 20:02:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:48,115 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 4187 transitions. [2022-11-18 20:02:48,115 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-18 20:02:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 4187 transitions. [2022-11-18 20:02:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:02:48,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:48,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:02:48,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:02:48,117 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1226869625, now seen corresponding path program 1 times [2022-11-18 20:02:48,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:48,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515441402] [2022-11-18 20:02:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:48,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:48,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515441402] [2022-11-18 20:02:48,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515441402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:48,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:48,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355069448] [2022-11-18 20:02:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:48,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:48,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:48,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:48,217 INFO L87 Difference]: Start difference. First operand 1471 states and 4187 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-18 20:02:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:48,315 INFO L93 Difference]: Finished difference Result 1011 states and 2701 transitions. [2022-11-18 20:02:48,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:48,316 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-18 20:02:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:48,322 INFO L225 Difference]: With dead ends: 1011 [2022-11-18 20:02:48,322 INFO L226 Difference]: Without dead ends: 1011 [2022-11-18 20:02:48,322 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-18 20:02:48,323 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:48,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-18 20:02:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-11-18 20:02:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 969 states have (on average 2.787409700722394) internal successors, (2701), 1010 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-18 20:02:48,354 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-18 20:02:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:48,354 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-18 20:02:48,354 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-18 20:02:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-18 20:02:48,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:02:48,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:48,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:02:48,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:02:48,356 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-18 20:02:48,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash -623492074, now seen corresponding path program 1 times [2022-11-18 20:02:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:48,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416448669] [2022-11-18 20:02:48,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:48,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:48,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:48,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416448669] [2022-11-18 20:02:48,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416448669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:48,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:48,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131680805] [2022-11-18 20:02:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:48,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:48,853 INFO L87 Difference]: Start difference. First operand 1011 states and 2701 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-18 20:02:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:49,068 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-11-18 20:02:49,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:02:49,069 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-18 20:02:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:49,075 INFO L225 Difference]: With dead ends: 1286 [2022-11-18 20:02:49,075 INFO L226 Difference]: Without dead ends: 1286 [2022-11-18 20:02:49,075 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-18 20:02:49,076 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:49,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:49,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-18 20:02:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-11-18 20:02:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1052 states have (on average 2.826045627376426) internal successors, (2973), 1093 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-11-18 20:02:49,110 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-11-18 20:02:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:49,111 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-11-18 20:02:49,111 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-18 20:02:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-11-18 20:02:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:02:49,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:49,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:02:49,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:02:49,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -623548494, now seen corresponding path program 1 times [2022-11-18 20:02:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:49,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251171641] [2022-11-18 20:02:49,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:49,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:49,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:49,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251171641] [2022-11-18 20:02:49,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251171641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:49,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:49,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:49,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503810025] [2022-11-18 20:02:49,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:49,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:02:49,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:49,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:02:49,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:02:49,389 INFO L87 Difference]: Start difference. First operand 1094 states and 2973 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-18 20:02:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:49,602 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-11-18 20:02:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:02:49,602 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-18 20:02:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:49,614 INFO L225 Difference]: With dead ends: 1280 [2022-11-18 20:02:49,614 INFO L226 Difference]: Without dead ends: 1280 [2022-11-18 20:02:49,614 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-18 20:02:49,615 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:49,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 12 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-18 20:02:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-11-18 20:02:49,645 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-18 20:02:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-18 20:02:49,649 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-18 20:02:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:49,651 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-18 20:02:49,651 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-18 20:02:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-18 20:02:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:02:49,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:49,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:49,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:02:49,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1780105148, now seen corresponding path program 1 times [2022-11-18 20:02:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:49,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299338811] [2022-11-18 20:02:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:49,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:49,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:49,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299338811] [2022-11-18 20:02:49,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299338811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:49,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:49,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:02:49,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281686731] [2022-11-18 20:02:49,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:49,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:49,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:49,736 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-18 20:02:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:49,840 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-18 20:02:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:49,840 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-18 20:02:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:49,842 INFO L225 Difference]: With dead ends: 434 [2022-11-18 20:02:49,842 INFO L226 Difference]: Without dead ends: 426 [2022-11-18 20:02:49,842 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-18 20:02:49,843 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-18 20:02:49,843 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-18 20:02:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-18 20:02:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-18 20:02:49,854 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-18 20:02:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-18 20:02:49,856 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-18 20:02:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:49,856 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-18 20:02:49,857 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-18 20:02:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-18 20:02:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:02:49,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:49,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:49,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:02:49,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1257894729, now seen corresponding path program 1 times [2022-11-18 20:02:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:49,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645838463] [2022-11-18 20:02:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:49,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645838463] [2022-11-18 20:02:49,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645838463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:49,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:49,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:02:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401927367] [2022-11-18 20:02:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:49,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:02:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:02:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:02:49,970 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-18 20:02:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:50,046 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-18 20:02:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:02:50,046 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-18 20:02:50,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:50,048 INFO L225 Difference]: With dead ends: 380 [2022-11-18 20:02:50,048 INFO L226 Difference]: Without dead ends: 380 [2022-11-18 20:02:50,049 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-18 20:02:50,049 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-18 20:02:50,050 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-18 20:02:50,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-18 20:02:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-18 20:02:50,059 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-18 20:02:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-18 20:02:50,061 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-18 20:02:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:50,061 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-18 20:02:50,061 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-18 20:02:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-18 20:02:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:02:50,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:50,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:50,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:02:50,063 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:50,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1257894728, now seen corresponding path program 1 times [2022-11-18 20:02:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:50,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226097112] [2022-11-18 20:02:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:50,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:50,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226097112] [2022-11-18 20:02:50,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226097112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:50,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:50,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:02:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344980390] [2022-11-18 20:02:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:50,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:50,459 INFO L87 Difference]: Start difference. First operand 380 states and 890 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-18 20:02:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:50,650 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-18 20:02:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:02:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-18 20:02:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:50,652 INFO L225 Difference]: With dead ends: 390 [2022-11-18 20:02:50,652 INFO L226 Difference]: Without dead ends: 390 [2022-11-18 20:02:50,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:50,653 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:50,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-18 20:02:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-18 20:02:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 374 states have (on average 2.4010695187165774) internal successors, (898), 383 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-18 20:02:50,664 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-18 20:02:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:50,665 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-18 20:02:50,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 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-18 20:02:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-18 20:02:50,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:02:50,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:50,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:50,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:02:50,667 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:02:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1098205855, now seen corresponding path program 1 times [2022-11-18 20:02:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:50,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638345749] [2022-11-18 20:02:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:02:50,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:50,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638345749] [2022-11-18 20:02:50,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638345749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:50,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:50,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:02:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879034988] [2022-11-18 20:02:50,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:50,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:02:50,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:02:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:02:50,890 INFO L87 Difference]: Start difference. First operand 384 states and 898 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-18 20:02:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:51,054 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-18 20:02:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:02:51,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-18 20:02:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:51,056 INFO L225 Difference]: With dead ends: 475 [2022-11-18 20:02:51,056 INFO L226 Difference]: Without dead ends: 475 [2022-11-18 20:02:51,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:02:51,057 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:51,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 9 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:02:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-18 20:02:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-18 20:02:51,068 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-18 20:02:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-18 20:02:51,070 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-18 20:02:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:51,071 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-18 20:02:51,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-18 20:02:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-18 20:02:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:02:51,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:51,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:51,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:02:51,072 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-18 20:02:51,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:51,073 INFO L85 PathProgramCache]: Analyzing trace with hash 315359300, now seen corresponding path program 1 times [2022-11-18 20:02:51,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:51,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390352474] [2022-11-18 20:02:51,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:51,938 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-18 20:02:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:51,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390352474] [2022-11-18 20:02:51,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390352474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:02:51,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:02:51,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:02:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021515943] [2022-11-18 20:02:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:02:51,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:02:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:02:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:02:51,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:02:51,941 INFO L87 Difference]: Start difference. First operand 475 states and 1103 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-18 20:02:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:02:52,249 INFO L93 Difference]: Finished difference Result 490 states and 1112 transitions. [2022-11-18 20:02:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:02:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-18 20:02:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:02:52,251 INFO L225 Difference]: With dead ends: 490 [2022-11-18 20:02:52,252 INFO L226 Difference]: Without dead ends: 490 [2022-11-18 20:02:52,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:02:52,252 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:02:52,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 21 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:02:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-18 20:02:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 464. [2022-11-18 20:02:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 454 states have (on average 2.350220264317181) internal successors, (1067), 463 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:02:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1067 transitions. [2022-11-18 20:02:52,264 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1067 transitions. Word has length 13 [2022-11-18 20:02:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:02:52,265 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1067 transitions. [2022-11-18 20:02:52,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-18 20:02:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1067 transitions. [2022-11-18 20:02:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:02:52,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:02:52,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:02:52,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:02:52,266 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-18 20:02:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:02:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1993996946, now seen corresponding path program 1 times [2022-11-18 20:02:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:02:52,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282674568] [2022-11-18 20:02:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:52,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:02:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:53,251 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-18 20:02:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:02:53,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282674568] [2022-11-18 20:02:53,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282674568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:02:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153003963] [2022-11-18 20:02:53,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:02:53,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:02:53,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:02:53,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:02:53,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:02:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:02:53,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-18 20:02:53,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:02:53,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:53,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:53,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:53,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:02:53,522 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:02:53,523 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-18 20:02:53,540 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:02:53,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:02:53,722 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-18 20:02:53,983 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-18 20:02:54,312 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-18 20:02:54,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:02:54,424 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-18 20:02:54,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-18 20:02:54,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:02:54,556 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_500 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_500 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:02:54,574 WARN L837 $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_500 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_500 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:02:54,592 WARN L837 $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_500 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_500 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:02:54,624 WARN L837 $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_496 Int) (v_ArrVal_500 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_496) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_496 Int) (v_ArrVal_500 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_496) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:02:54,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:02:54,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-18 20:03:01,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-18 20:03:01,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153003963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:03:01,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:03:01,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-18 20:03:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584481258] [2022-11-18 20:03:01,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:01,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:03:01,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:01,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:03:01,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=360, Unknown=4, NotChecked=172, Total=650 [2022-11-18 20:03:01,923 INFO L87 Difference]: Start difference. First operand 464 states and 1067 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-18 20:03:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:02,846 INFO L93 Difference]: Finished difference Result 466 states and 1072 transitions. [2022-11-18 20:03:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:03:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-18 20:03:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:02,849 INFO L225 Difference]: With dead ends: 466 [2022-11-18 20:03:02,849 INFO L226 Difference]: Without dead ends: 466 [2022-11-18 20:03:02,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=179, Invalid=589, Unknown=4, NotChecked=220, Total=992 [2022-11-18 20:03:02,850 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 421 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:02,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 66 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 421 Unchecked, 0.3s Time] [2022-11-18 20:03:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-18 20:03:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 465. [2022-11-18 20:03:02,862 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-18 20:03:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1070 transitions. [2022-11-18 20:03:02,864 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1070 transitions. Word has length 13 [2022-11-18 20:03:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:02,864 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 1070 transitions. [2022-11-18 20:03:02,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 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-18 20:03:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1070 transitions. [2022-11-18 20:03:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:03:02,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:02,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:02,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:03:03,073 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-18 20:03:03,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1143154647, now seen corresponding path program 1 times [2022-11-18 20:03:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:03,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421690275] [2022-11-18 20:03:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:19,157 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-18 20:03:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:19,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421690275] [2022-11-18 20:03:19,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421690275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:19,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750958623] [2022-11-18 20:03:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:19,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:19,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:19,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:19,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:03:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:19,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-18 20:03:19,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:19,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:19,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:19,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:19,392 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:19,393 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-18 20:03:19,417 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:03:19,418 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:03:19,575 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-18 20:03:19,812 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-18 20:03:20,102 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-18 20:03:20,438 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-18 20:03:20,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:20,587 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-18 20:03:20,733 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-18 20:03:20,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:21,068 WARN L837 $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_596 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_596 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:03:21,082 WARN L837 $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_596 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_596 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:03:21,107 WARN L837 $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_593 Int) (v_ArrVal_596 (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_593) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_593 Int) (v_ArrVal_596 (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_593) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_596) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-18 20:03:21,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:03:21,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-18 20:03:29,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1243| Int) (v_prenex_3 Int) (v_ArrVal_591 Int) (v_prenex_4 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_589))) (let ((.cse3 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1243| 4)))) (or (< (* 4 (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse3 .cse4 v_ArrVal_591))) (store (store .cse1 (+ 1608 |c_~#queue~0.offset|) v_prenex_3) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_4) |c_~#queue~0.base|) .cse2)) 1609) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1243| (select .cse3 .cse2))) (not (<= 0 .cse4)))))) is different from false [2022-11-18 20:03:29,976 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-18 20:03:29,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750958623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:03:29,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:03:29,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 27 [2022-11-18 20:03:29,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322372934] [2022-11-18 20:03:29,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:29,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:03:29,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:03:29,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=475, Unknown=8, NotChecked=196, Total=812 [2022-11-18 20:03:29,981 INFO L87 Difference]: Start difference. First operand 465 states and 1070 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:03:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:32,031 INFO L93 Difference]: Finished difference Result 475 states and 1091 transitions. [2022-11-18 20:03:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:03:32,031 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:03:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:32,033 INFO L225 Difference]: With dead ends: 475 [2022-11-18 20:03:32,033 INFO L226 Difference]: Without dead ends: 475 [2022-11-18 20:03:32,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=191, Invalid=629, Unknown=8, NotChecked=228, Total=1056 [2022-11-18 20:03:32,035 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:32,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 272 Invalid, 0 Unknown, 320 Unchecked, 1.1s Time] [2022-11-18 20:03:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-18 20:03:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-18 20:03:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 465 states have (on average 2.346236559139785) internal successors, (1091), 474 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:03:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1091 transitions. [2022-11-18 20:03:32,047 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1091 transitions. Word has length 14 [2022-11-18 20:03:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:32,047 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1091 transitions. [2022-11-18 20:03:32,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:03:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1091 transitions. [2022-11-18 20:03:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:03:32,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:32,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:32,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:03:32,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:03:32,254 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-18 20:03:32,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash -9132515, now seen corresponding path program 2 times [2022-11-18 20:03:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:32,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767520688] [2022-11-18 20:03:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:33,460 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-18 20:03:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:33,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767520688] [2022-11-18 20:03:33,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767520688] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:33,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830203059] [2022-11-18 20:03:33,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:03:33,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:33,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:33,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:33,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:03:33,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:03:33,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:03:33,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:03:33,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:33,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:33,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:33,713 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:33,713 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-18 20:03:33,741 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:03:33,741 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:03:33,920 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-18 20:03:33,992 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-18 20:03:34,197 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-18 20:03:34,429 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-18 20:03:34,511 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-18 20:03:34,582 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-18 20:03:34,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:34,729 WARN L837 $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_693 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_693 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:03:34,752 WARN L837 $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_693 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_693 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:03:34,785 WARN L837 $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_693 (Array Int Int)) (v_ArrVal_689 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_689) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_689) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:03:34,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:03:34,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-18 20:03:43,008 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:03:51,368 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:03:59,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| .cse0)) (forall ((v_ArrVal_687 Int) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_689 Int) (v_ArrVal_686 (Array Int Int))) (< (* (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store (select .cse1 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| 4) |c_~#queue~0.offset|) v_ArrVal_687))) (store (store .cse2 .cse3 v_ArrVal_689) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_693) |c_~#queue~0.base|) .cse4) 4) 1609)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| .cse0)) (forall ((v_ArrVal_687 Int) (v_prenex_6 Int) (v_prenex_5 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_686))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store (select .cse5 |c_~#queue~0.base|) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1247| 4) |c_~#queue~0.offset|) v_ArrVal_687))) (store (store .cse6 .cse3 v_prenex_6) .cse4 (+ (select .cse6 .cse4) 1))))) |c_~#stored_elements~0.base| v_prenex_5) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))))) is different from false [2022-11-18 20:03:59,978 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-18 20:03:59,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830203059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:03:59,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:03:59,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-18 20:03:59,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702219331] [2022-11-18 20:03:59,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:03:59,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:03:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:03:59,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=453, Unknown=13, NotChecked=188, Total=756 [2022-11-18 20:03:59,982 INFO L87 Difference]: Start difference. First operand 475 states and 1091 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:04:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:04,170 INFO L93 Difference]: Finished difference Result 624 states and 1427 transitions. [2022-11-18 20:04:04,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:04:04,171 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:04:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:04,174 INFO L225 Difference]: With dead ends: 624 [2022-11-18 20:04:04,174 INFO L226 Difference]: Without dead ends: 624 [2022-11-18 20:04:04,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=202, Invalid=791, Unknown=15, NotChecked=252, Total=1260 [2022-11-18 20:04:04,176 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 234 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:04,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 96 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 360 Invalid, 0 Unknown, 750 Unchecked, 0.7s Time] [2022-11-18 20:04:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-18 20:04:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2022-11-18 20:04:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 532 states have (on average 2.3609022556390977) internal successors, (1256), 541 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:04:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1256 transitions. [2022-11-18 20:04:04,200 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1256 transitions. Word has length 14 [2022-11-18 20:04:04,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:04,201 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1256 transitions. [2022-11-18 20:04:04,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:04:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1256 transitions. [2022-11-18 20:04:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:04:04,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:04,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:04,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:04,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:04:04,409 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-18 20:04:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1010142995, now seen corresponding path program 3 times [2022-11-18 20:04:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:04:04,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128194674] [2022-11-18 20:04:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:04:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:05,662 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-18 20:04:05,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:04:05,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128194674] [2022-11-18 20:04:05,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128194674] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:05,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785677932] [2022-11-18 20:04:05,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:04:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:05,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:04:05,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:04:05,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:04:05,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:04:05,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:04:05,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:04:05,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:05,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:05,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:05,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:05,965 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:04:05,966 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-18 20:04:06,007 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:04:06,007 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:04:06,269 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-18 20:04:06,554 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 35 treesize of output 37 [2022-11-18 20:04:06,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 42 treesize of output 37 [2022-11-18 20:04:07,054 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-18 20:04:07,173 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-18 20:04:07,276 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-18 20:04:07,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:07,490 WARN L837 $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_790 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_790 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:04:07,908 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_785))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_786) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_785))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_786) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:04:07,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:04:07,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2022-11-18 20:04:10,027 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_786 Int) (v_ArrVal_790 (Array Int Int)) (v_ArrVal_785 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_785))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_786) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_790) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int)) (v_prenex_7 Int)) (< (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_9))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_prenex_7) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_8) |c_~#queue~0.base|) .cse4) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-11-18 20:04:20,986 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-18 20:04:20,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785677932] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:04:20,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:04:20,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:04:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128355569] [2022-11-18 20:04:20,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:20,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:04:20,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:20,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:04:20,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=501, Unknown=33, NotChecked=150, Total=812 [2022-11-18 20:04:20,990 INFO L87 Difference]: Start difference. First operand 542 states and 1256 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:04:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:24,844 INFO L93 Difference]: Finished difference Result 642 states and 1480 transitions. [2022-11-18 20:04:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:04:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:04:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:24,847 INFO L225 Difference]: With dead ends: 642 [2022-11-18 20:04:24,848 INFO L226 Difference]: Without dead ends: 642 [2022-11-18 20:04:24,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=202, Invalid=762, Unknown=40, NotChecked=186, Total=1190 [2022-11-18 20:04:24,849 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 125 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:24,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 119 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 0 Unknown, 482 Unchecked, 0.7s Time] [2022-11-18 20:04:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-11-18 20:04:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 548. [2022-11-18 20:04:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 538 states have (on average 2.358736059479554) internal successors, (1269), 547 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:04:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1269 transitions. [2022-11-18 20:04:24,867 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1269 transitions. Word has length 14 [2022-11-18 20:04:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:24,867 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 1269 transitions. [2022-11-18 20:04:24,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:04:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1269 transitions. [2022-11-18 20:04:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:04:24,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:24,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:24,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:25,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:25,075 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-18 20:04:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1858908543, now seen corresponding path program 4 times [2022-11-18 20:04:25,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:04:25,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655219575] [2022-11-18 20:04:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:25,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:04:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:26,328 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-18 20:04:26,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:04:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655219575] [2022-11-18 20:04:26,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655219575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:26,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096865664] [2022-11-18 20:04:26,329 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:04:26,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:26,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:04:26,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:04:26,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:04:26,534 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:04:26,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:04:26,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:04:26,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:26,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:26,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:26,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:26,594 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:04:26,594 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-18 20:04:26,635 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:04:26,636 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:04:26,886 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-18 20:04:27,168 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-18 20:04:27,319 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-18 20:04:27,618 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-18 20:04:27,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:27,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 74 treesize of output 76 [2022-11-18 20:04:27,845 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-18 20:04:27,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:27,917 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_888 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_888 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-18 20:04:27,937 WARN L837 $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_888 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_888 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:04:27,958 WARN L837 $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_888 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_888 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_888) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:04:27,993 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_888 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_885))) (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_888) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_888 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_885))) (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_888) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2022-11-18 20:04:28,022 WARN L837 $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_884 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_884)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_885))) (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_888) |c_~#queue~0.base|) .cse5)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_884 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_884)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_885))) (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_888) |c_~#queue~0.base|) .cse5))))))) is different from false [2022-11-18 20:04:28,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:04:28,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2022-11-18 20:04:30,130 WARN L837 $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 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_10 Int) (v_prenex_12 (Array Int Int)) (v_prenex_11 (Array Int Int))) (< (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_prenex_10)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_12))) (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_prenex_11) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_884 Int) (v_ArrVal_888 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_884)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_885))) (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_888) |c_~#queue~0.base|) .cse5))))))) is different from false [2022-11-18 20:04:49,674 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:04:53,190 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-18 20:04:53,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096865664] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:04:53,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:04:53,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-18 20:04:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818825560] [2022-11-18 20:04:53,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:53,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:04:53,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:53,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:04:53,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=383, Unknown=9, NotChecked=270, Total=756 [2022-11-18 20:04:53,193 INFO L87 Difference]: Start difference. First operand 548 states and 1269 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:04:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:55,692 INFO L93 Difference]: Finished difference Result 709 states and 1644 transitions. [2022-11-18 20:04:55,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:04:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:04:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:55,696 INFO L225 Difference]: With dead ends: 709 [2022-11-18 20:04:55,696 INFO L226 Difference]: Without dead ends: 709 [2022-11-18 20:04:55,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=168, Invalid=717, Unknown=9, NotChecked=366, Total=1260 [2022-11-18 20:04:55,697 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 123 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:55,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 138 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 404 Invalid, 0 Unknown, 826 Unchecked, 1.0s Time] [2022-11-18 20:04:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-11-18 20:04:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 548. [2022-11-18 20:04:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 538 states have (on average 2.358736059479554) internal successors, (1269), 547 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:04:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1269 transitions. [2022-11-18 20:04:55,715 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1269 transitions. Word has length 14 [2022-11-18 20:04:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:55,716 INFO L495 AbstractCegarLoop]: Abstraction has 548 states and 1269 transitions. [2022-11-18 20:04:55,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:04:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1269 transitions. [2022-11-18 20:04:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:04:55,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:55,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:55,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:55,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:55,924 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-18 20:04:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1525846337, now seen corresponding path program 5 times [2022-11-18 20:04:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:04:55,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862845943] [2022-11-18 20:04:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:04:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:57,353 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-18 20:04:57,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:04:57,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862845943] [2022-11-18 20:04:57,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862845943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:57,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104895049] [2022-11-18 20:04:57,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:04:57,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:04:57,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:04:57,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:04:57,560 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:04:57,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:04:57,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:04:57,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:57,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:57,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:57,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:57,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:57,647 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:04:57,648 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-18 20:04:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:57,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:57,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:57,676 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-18 20:04:57,744 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:04:57,744 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:04:58,150 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 56 treesize of output 47 [2022-11-18 20:04:58,496 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 62 treesize of output 57 [2022-11-18 20:04:58,748 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 60 treesize of output 62 [2022-11-18 20:04:59,069 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 75 treesize of output 68 [2022-11-18 20:04:59,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:59,229 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 114 treesize of output 116 [2022-11-18 20:04:59,350 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-18 20:04:59,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:59,433 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_987 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_987 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:04:59,455 WARN L837 $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_987 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_987 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:04:59,477 WARN L837 $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_987 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_987 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_987) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:04:59,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_987 (Array Int Int)) (v_ArrVal_984 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_984))) (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_987) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_987 (Array Int Int)) (v_ArrVal_984 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_984))) (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_987) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:04:59,553 WARN L837 $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_983 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_984 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_983)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_984))) (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_987) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_983 Int) (v_ArrVal_987 (Array Int Int)) (v_ArrVal_984 (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_983)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_984))) (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_987) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:05:00,719 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-18 20:05:00,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104895049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:05:00,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:05:00,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-18 20:05:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418243682] [2022-11-18 20:05:00,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:05:00,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:05:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:05:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:05:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=421, Unknown=5, NotChecked=230, Total=756 [2022-11-18 20:05:00,721 INFO L87 Difference]: Start difference. First operand 548 states and 1269 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:05:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:03,260 INFO L93 Difference]: Finished difference Result 788 states and 1836 transitions. [2022-11-18 20:05:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:05:03,261 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:05:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:03,264 INFO L225 Difference]: With dead ends: 788 [2022-11-18 20:05:03,264 INFO L226 Difference]: Without dead ends: 788 [2022-11-18 20:05:03,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 5 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=200, Invalid=871, Unknown=5, NotChecked=330, Total=1406 [2022-11-18 20:05:03,265 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 803 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:03,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 131 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 803 Unchecked, 0.7s Time] [2022-11-18 20:05:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-18 20:05:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 574. [2022-11-18 20:05:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 564 states have (on average 2.382978723404255) internal successors, (1344), 573 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:05:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1344 transitions. [2022-11-18 20:05:03,283 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1344 transitions. Word has length 14 [2022-11-18 20:05:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:03,284 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 1344 transitions. [2022-11-18 20:05:03,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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-18 20:05:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1344 transitions. [2022-11-18 20:05:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:05:03,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:03,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:03,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:05:03,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-18 20:05:03,492 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-18 20:05:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1686717737, now seen corresponding path program 6 times [2022-11-18 20:05:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:05:03,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438334450] [2022-11-18 20:05:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:05:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:05:23,375 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-18 20:05:23,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:05:23,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438334450] [2022-11-18 20:05:23,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438334450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:05:23,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372109131] [2022-11-18 20:05:23,376 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:05:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:05:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:05:23,377 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:05:23,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:05:23,560 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-18 20:05:23,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:05:23,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-18 20:05:23,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:05:23,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:23,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:23,625 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:05:23,626 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-18 20:05:23,649 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:05:23,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:05:24,026 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-18 20:05:24,267 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-18 20:05:24,581 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:05:24,814 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 42 treesize of output 38 [2022-11-18 20:05:25,025 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 45 treesize of output 47 [2022-11-18 20:05:25,201 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-18 20:05:25,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:05:25,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-18 20:05:25,399 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1081 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1081) |c_~#queue~0.base|) .cse0) 4) 1605)) (forall ((v_ArrVal_1081 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1081) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-18 20:05:25,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:05:25,414 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-18 20:05:25,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:05:25,435 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 42 treesize of output 41 [2022-11-18 20:05:25,444 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 9 treesize of output 5 [2022-11-18 20:05:25,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:05:25,484 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 28 treesize of output 29 [2022-11-18 20:05:25,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:05:25,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:05:25,496 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 26 treesize of output 14 [2022-11-18 20:05:34,633 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:05:34,755 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-18 20:05:34,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372109131] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:05:34,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:05:34,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 23 [2022-11-18 20:05:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561643419] [2022-11-18 20:05:34,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:05:34,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:05:34,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:05:34,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:05:34,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=456, Unknown=1, NotChecked=44, Total=600 [2022-11-18 20:05:34,758 INFO L87 Difference]: Start difference. First operand 574 states and 1344 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-18 20:05:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:05:59,196 INFO L93 Difference]: Finished difference Result 747 states and 1753 transitions. [2022-11-18 20:05:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:05:59,199 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-18 20:05:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:05:59,201 INFO L225 Difference]: With dead ends: 747 [2022-11-18 20:05:59,202 INFO L226 Difference]: Without dead ends: 747 [2022-11-18 20:05:59,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=259, Invalid=1076, Unknown=1, NotChecked=70, Total=1406 [2022-11-18 20:05:59,203 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 252 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:05:59,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 87 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 448 Unchecked, 3.3s Time] [2022-11-18 20:05:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-11-18 20:05:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 575. [2022-11-18 20:05:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 565 states have (on average 2.382300884955752) internal successors, (1346), 574 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-18 20:05:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1346 transitions. [2022-11-18 20:05:59,220 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1346 transitions. Word has length 14 [2022-11-18 20:05:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:05:59,221 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 1346 transitions. [2022-11-18 20:05:59,221 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-18 20:05:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1346 transitions. [2022-11-18 20:05:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:05:59,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:05:59,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:05:59,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:05:59,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:05:59,429 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-18 20:05:59,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:05:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1684353677, now seen corresponding path program 7 times [2022-11-18 20:05:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:05:59,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542316841] [2022-11-18 20:05:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:05:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:05:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:01,606 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-18 20:06:01,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542316841] [2022-11-18 20:06:01,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542316841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696846551] [2022-11-18 20:06:01,607 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:06:01,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:01,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:01,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:01,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:06:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:01,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-18 20:06:01,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:01,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:01,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:01,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:01,882 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:06:01,883 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-18 20:06:01,941 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:06:01,941 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:06:02,245 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-18 20:06:02,587 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-18 20:06:02,991 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-18 20:06:03,143 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-18 20:06:03,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:03,291 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-18 20:06:03,420 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-18 20:06:03,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:03,685 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#stored_elements~0.base| v_ArrVal_1177) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#stored_elements~0.base| v_ArrVal_1177) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:06:03,715 WARN L837 $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_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#stored_elements~0.base| v_ArrVal_1177) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#stored_elements~0.base| v_ArrVal_1177) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:06:03,738 WARN L837 $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_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#stored_elements~0.base| v_ArrVal_1177) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#stored_elements~0.base| v_ArrVal_1177) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:06:04,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:06:04,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-18 20:06:10,691 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:12,726 WARN L837 $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 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1171 Int) (v_ArrVal_1173 Int) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_1171))) (store (store .cse0 .cse1 v_ArrVal_1173) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#stored_elements~0.base| v_ArrVal_1177) |c_~#queue~0.base|) .cse5))))) (forall ((v_ArrVal_1171 Int) (v_prenex_13 Int) (v_prenex_14 (Array Int Int)) (v_prenex_15 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_1171))) (store (store .cse6 .cse1 v_prenex_13) .cse2 (+ (select .cse6 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_15) |c_~#stored_elements~0.base| v_prenex_14) |c_~#queue~0.base|) .cse5) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-11-18 20:06:15,529 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-18 20:06:15,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696846551] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:15,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:15,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:06:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439705111] [2022-11-18 20:06:15,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:15,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:06:15,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:15,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:06:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=467, Unknown=23, NotChecked=196, Total=812 [2022-11-18 20:06:15,532 INFO L87 Difference]: Start difference. First operand 575 states and 1346 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:06:26,098 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 29 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:26,723 INFO L93 Difference]: Finished difference Result 771 states and 1796 transitions. [2022-11-18 20:06:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:06:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:06:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:26,726 INFO L225 Difference]: With dead ends: 771 [2022-11-18 20:06:26,727 INFO L226 Difference]: Without dead ends: 771 [2022-11-18 20:06:26,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=237, Invalid=876, Unknown=25, NotChecked=268, Total=1406 [2022-11-18 20:06:26,728 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 206 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 685 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:26,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 154 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 450 Invalid, 0 Unknown, 685 Unchecked, 1.2s Time] [2022-11-18 20:06:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-11-18 20:06:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 575. [2022-11-18 20:06:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 565 states have (on average 2.382300884955752) internal successors, (1346), 574 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-18 20:06:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1346 transitions. [2022-11-18 20:06:26,747 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1346 transitions. Word has length 14 [2022-11-18 20:06:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:26,747 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 1346 transitions. [2022-11-18 20:06:26,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:06:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1346 transitions. [2022-11-18 20:06:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:06:26,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:26,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:26,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 20:06:26,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-18 20:06:26,956 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-18 20:06:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:26,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1684365767, now seen corresponding path program 8 times [2022-11-18 20:06:26,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:26,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373915955] [2022-11-18 20:06:26,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:26,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:28,476 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-18 20:06:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373915955] [2022-11-18 20:06:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373915955] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487605497] [2022-11-18 20:06:28,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:06:28,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:28,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:28,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:06:28,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:06:28,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:06:28,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:06:28,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:28,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:28,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:28,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:06:28,797 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:06:28,797 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-18 20:06:28,846 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:06:28,846 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:06:29,138 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-18 20:06:29,462 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-18 20:06:29,851 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-18 20:06:30,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-18 20:06:30,142 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-18 20:06:30,255 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-18 20:06:30,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:30,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1274 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1274 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:06:30,359 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:06:32,576 WARN L837 $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_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:06:32,627 WARN L837 $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_1269 Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1269) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1269 Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1269) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1274) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:06:32,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:06:32,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-18 20:06:47,200 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-18 20:06:47,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487605497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:47,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:47,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:06:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806835254] [2022-11-18 20:06:47,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:47,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:06:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:47,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:06:47,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=486, Unknown=14, NotChecked=196, Total=812 [2022-11-18 20:06:47,203 INFO L87 Difference]: Start difference. First operand 575 states and 1346 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:06:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:51,472 INFO L93 Difference]: Finished difference Result 688 states and 1605 transitions. [2022-11-18 20:06:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:06:51,472 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:06:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:51,474 INFO L225 Difference]: With dead ends: 688 [2022-11-18 20:06:51,475 INFO L226 Difference]: Without dead ends: 688 [2022-11-18 20:06:51,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 5 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=205, Invalid=853, Unknown=14, NotChecked=260, Total=1332 [2022-11-18 20:06:51,476 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 109 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:51,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 114 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 338 Invalid, 0 Unknown, 600 Unchecked, 0.8s Time] [2022-11-18 20:06:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-11-18 20:06:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 575. [2022-11-18 20:06:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 565 states have (on average 2.382300884955752) internal successors, (1346), 574 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-18 20:06:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1346 transitions. [2022-11-18 20:06:51,492 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1346 transitions. Word has length 14 [2022-11-18 20:06:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:51,493 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 1346 transitions. [2022-11-18 20:06:51,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:06:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1346 transitions. [2022-11-18 20:06:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:06:51,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:51,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:51,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 20:06:51,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-18 20:06:51,701 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-18 20:06:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash 350223819, now seen corresponding path program 9 times [2022-11-18 20:06:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:51,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924711988] [2022-11-18 20:06:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:53,190 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-18 20:06:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924711988] [2022-11-18 20:06:53,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924711988] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:53,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654429908] [2022-11-18 20:06:53,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:06:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:53,194 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:53,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:06:53,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:06:53,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:06:53,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:06:53,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:53,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:53,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:53,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:06:53,466 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:06:53,466 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-18 20:06:53,510 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:06:53,511 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:06:53,820 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-18 20:06:53,984 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 35 treesize of output 37 [2022-11-18 20:06:54,295 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-18 20:06:54,675 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-18 20:06:54,833 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-18 20:06:54,951 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-18 20:06:54,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:55,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1371 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1371) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1371 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1371) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:06:55,529 WARN L837 $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_1367 Int) (v_ArrVal_1371 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1367) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1371) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1367 Int) (v_ArrVal_1371 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1367) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1371) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:06:55,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:06:55,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-18 20:07:03,813 WARN L233 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:07:22,142 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-18 20:07:22,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654429908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:22,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:22,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:07:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701425790] [2022-11-18 20:07:22,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:22,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:07:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:07:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=568, Unknown=23, NotChecked=102, Total=812 [2022-11-18 20:07:22,145 INFO L87 Difference]: Start difference. First operand 575 states and 1346 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:07:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:24,085 INFO L93 Difference]: Finished difference Result 759 states and 1768 transitions. [2022-11-18 20:07:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:07:24,086 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:07:24,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:24,088 INFO L225 Difference]: With dead ends: 759 [2022-11-18 20:07:24,089 INFO L226 Difference]: Without dead ends: 759 [2022-11-18 20:07:24,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=221, Invalid=954, Unknown=23, NotChecked=134, Total=1332 [2022-11-18 20:07:24,090 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 126 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 595 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:24,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 129 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 595 Unchecked, 0.8s Time] [2022-11-18 20:07:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-11-18 20:07:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 600. [2022-11-18 20:07:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 590 states have (on average 2.4033898305084747) internal successors, (1418), 599 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1418 transitions. [2022-11-18 20:07:24,109 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1418 transitions. Word has length 14 [2022-11-18 20:07:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:24,109 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 1418 transitions. [2022-11-18 20:07:24,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 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-18 20:07:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1418 transitions. [2022-11-18 20:07:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:07:24,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:24,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:24,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:24,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-18 20:07:24,318 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-18 20:07:24,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1332183909, now seen corresponding path program 1 times [2022-11-18 20:07:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:24,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676467055] [2022-11-18 20:07:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:25,703 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-18 20:07:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:25,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676467055] [2022-11-18 20:07:25,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676467055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:07:25,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289812755] [2022-11-18 20:07:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:25,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:25,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:07:25,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:07:25,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:07:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:25,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:07:25,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:25,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:25,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:25,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:25,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:07:25,959 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-18 20:07:26,007 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:07:26,008 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:07:26,304 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-18 20:07:26,621 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 35 treesize of output 37 [2022-11-18 20:07:26,786 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-18 20:07:27,261 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-18 20:07:27,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:27,426 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-18 20:07:27,565 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-18 20:07:27,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:27,656 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1468 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1468 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:07:27,680 WARN L837 $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_1468 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1468 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:07:28,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:07:28,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2022-11-18 20:07:35,023 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-18 20:07:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289812755] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:35,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:35,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:07:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314224572] [2022-11-18 20:07:35,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:35,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:07:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:35,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:07:35,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=549, Unknown=37, NotChecked=102, Total=812 [2022-11-18 20:07:35,025 INFO L87 Difference]: Start difference. First operand 600 states and 1418 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-18 20:07:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:36,994 INFO L93 Difference]: Finished difference Result 820 states and 1945 transitions. [2022-11-18 20:07:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:07:36,995 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-18 20:07:36,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:36,998 INFO L225 Difference]: With dead ends: 820 [2022-11-18 20:07:36,998 INFO L226 Difference]: Without dead ends: 820 [2022-11-18 20:07:36,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=174, Invalid=789, Unknown=37, NotChecked=122, Total=1122 [2022-11-18 20:07:37,000 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 137 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 882 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:37,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 139 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 317 Invalid, 0 Unknown, 882 Unchecked, 0.9s Time] [2022-11-18 20:07:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-18 20:07:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 645. [2022-11-18 20:07:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 635 states have (on average 2.4141732283464568) internal successors, (1533), 644 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:07:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1533 transitions. [2022-11-18 20:07:37,019 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1533 transitions. Word has length 15 [2022-11-18 20:07:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:37,020 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 1533 transitions. [2022-11-18 20:07:37,020 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-18 20:07:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1533 transitions. [2022-11-18 20:07:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:07:37,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:37,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:37,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:37,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-18 20:07:37,228 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:07:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1249672449, now seen corresponding path program 2 times [2022-11-18 20:07:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:37,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596720435] [2022-11-18 20:07:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:38,702 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-18 20:07:38,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:38,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596720435] [2022-11-18 20:07:38,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596720435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:07:38,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557515690] [2022-11-18 20:07:38,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:07:38,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:38,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:07:38,704 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:07:38,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:07:38,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:07:38,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:07:38,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-18 20:07:38,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:38,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:38,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:38,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:07:38,994 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:07:38,995 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-18 20:07:39,048 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:07:39,048 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:07:39,359 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 56 treesize of output 47 [2022-11-18 20:07:39,669 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 55 treesize of output 57 [2022-11-18 20:07:39,831 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 62 treesize of output 57 [2022-11-18 20:07:40,290 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 51 treesize of output 44 [2022-11-18 20:07:40,427 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 41 treesize of output 43 [2022-11-18 20:07:40,582 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-18 20:07:40,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:40,698 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1565 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1565 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:07:40,727 WARN L837 $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_1565 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1565 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:07:40,951 WARN L837 $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_1565 (Array Int Int)) (v_ArrVal_1562 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1562) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 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_1562) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-18 20:07:40,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 Int) (v_ArrVal_1560 (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_1560))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1562) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse4)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 Int) (v_ArrVal_1560 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1560))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1562) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse4))))))) is different from false [2022-11-18 20:07:41,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:07:41,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2022-11-18 20:07:47,432 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:07:53,648 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:07:57,932 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-18 20:07:57,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557515690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:57,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:57,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:07:57,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567474803] [2022-11-18 20:07:57,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:57,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:07:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:07:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=16, NotChecked=196, Total=812 [2022-11-18 20:07:57,935 INFO L87 Difference]: Start difference. First operand 645 states and 1533 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-18 20:08:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:00,015 INFO L93 Difference]: Finished difference Result 765 states and 1817 transitions. [2022-11-18 20:08:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:08:00,016 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-18 20:08:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:00,018 INFO L225 Difference]: With dead ends: 765 [2022-11-18 20:08:00,018 INFO L226 Difference]: Without dead ends: 765 [2022-11-18 20:08:00,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=199, Invalid=857, Unknown=16, NotChecked=260, Total=1332 [2022-11-18 20:08:00,019 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 831 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:00,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 127 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 299 Invalid, 0 Unknown, 831 Unchecked, 0.8s Time] [2022-11-18 20:08:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-18 20:08:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 646. [2022-11-18 20:08:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 636 states have (on average 2.4150943396226414) internal successors, (1536), 645 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1536 transitions. [2022-11-18 20:08:00,043 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 1536 transitions. Word has length 15 [2022-11-18 20:08:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:00,045 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 1536 transitions. [2022-11-18 20:08:00,045 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-18 20:08:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 1536 transitions. [2022-11-18 20:08:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:08:00,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:00,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:00,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:08:00,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:00,255 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-18 20:08:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash -139118327, now seen corresponding path program 3 times [2022-11-18 20:08:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:00,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551815748] [2022-11-18 20:08:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:00,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:01,485 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-18 20:08:01,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551815748] [2022-11-18 20:08:01,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551815748] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106579949] [2022-11-18 20:08:01,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:08:01,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:01,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:01,487 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:01,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:08:01,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:08:01,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:08:01,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:08:01,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:01,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,768 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:08:01,769 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-18 20:08:01,815 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:08:01,816 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:08:02,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 46 treesize of output 39 [2022-11-18 20:08:02,489 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-18 20:08:02,751 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-18 20:08:03,157 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-18 20:08:03,312 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-18 20:08:03,441 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-18 20:08:03,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:03,543 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1662 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1662) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1662 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1662) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-18 20:08:03,565 WARN L837 $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_1662 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1662) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1662 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1662) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:08:03,589 WARN L837 $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_1662 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1662) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1662 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1662) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:08:03,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1659))) (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_1662) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1662 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1659))) (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_1662) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:08:03,680 WARN L837 $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_1659 (Array Int Int)) (v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1658 Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1658)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1659))) (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_1662) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1659 (Array Int Int)) (v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1658 Int)) (<= (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1658)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1659))) (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_1662) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:08:03,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:03,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2022-11-18 20:08:17,189 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-18 20:08:17,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106579949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:17,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:08:17,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-18 20:08:17,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770655516] [2022-11-18 20:08:17,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:17,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:08:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:17,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:08:17,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=413, Unknown=11, NotChecked=230, Total=756 [2022-11-18 20:08:17,191 INFO L87 Difference]: Start difference. First operand 646 states and 1536 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-18 20:08:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:19,901 INFO L93 Difference]: Finished difference Result 834 states and 2008 transitions. [2022-11-18 20:08:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:08:19,902 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-18 20:08:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:19,904 INFO L225 Difference]: With dead ends: 834 [2022-11-18 20:08:19,904 INFO L226 Difference]: Without dead ends: 834 [2022-11-18 20:08:19,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 5 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=198, Invalid=865, Unknown=13, NotChecked=330, Total=1406 [2022-11-18 20:08:19,905 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 694 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:19,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 139 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 334 Invalid, 0 Unknown, 694 Unchecked, 0.9s Time] [2022-11-18 20:08:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-11-18 20:08:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 638. [2022-11-18 20:08:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 628 states have (on average 2.4156050955414012) internal successors, (1517), 637 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1517 transitions. [2022-11-18 20:08:19,925 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1517 transitions. Word has length 15 [2022-11-18 20:08:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:19,926 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1517 transitions. [2022-11-18 20:08:19,926 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-18 20:08:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1517 transitions. [2022-11-18 20:08:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:08:19,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:19,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:19,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-18 20:08:20,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 20:08:20,134 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-18 20:08:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash -758772301, now seen corresponding path program 4 times [2022-11-18 20:08:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:20,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423968263] [2022-11-18 20:08:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:21,385 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-18 20:08:21,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:21,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423968263] [2022-11-18 20:08:21,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423968263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:21,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446586901] [2022-11-18 20:08:21,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:08:21,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:21,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:21,388 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:21,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:08:21,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:08:21,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:08:21,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-18 20:08:21,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:21,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:21,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:21,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:21,725 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:08:21,726 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-18 20:08:21,763 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:08:21,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:08:22,062 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-18 20:08:22,385 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-18 20:08:22,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:08:22,896 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 42 treesize of output 38 [2022-11-18 20:08:23,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:23,039 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 45 treesize of output 47 [2022-11-18 20:08:23,151 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-18 20:08:23,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:23,240 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1756 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1756) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1756 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1756) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:08:23,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:23,257 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 31 treesize of output 32 [2022-11-18 20:08:23,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:23,284 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 52 treesize of output 51 [2022-11-18 20:08:23,333 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-18 20:08:23,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:23,349 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 28 treesize of output 29 [2022-11-18 20:08:23,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:08:23,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:23,361 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 26 treesize of output 14 [2022-11-18 20:08:23,735 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:23,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-11-18 20:08:26,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1291| Int)) (or (forall ((v_ArrVal_1750 Int)) (< (* (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1291| 4) |c_~#queue~0.offset|) v_ArrVal_1750) .cse1) 4) 1605)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1291| .cse2)))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1291| Int)) (or (forall ((v_ArrVal_1750 Int)) (<= 0 (+ (* (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1291| 4) |c_~#queue~0.offset|) v_ArrVal_1750) .cse1) 4) |c_~#queue~0.offset| 4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1291| .cse2))))))) is different from false [2022-11-18 20:08:26,284 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-18 20:08:26,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446586901] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:26,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:08:26,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2022-11-18 20:08:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612265407] [2022-11-18 20:08:26,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:26,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:08:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:26,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:08:26,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=412, Unknown=2, NotChecked=86, Total=600 [2022-11-18 20:08:26,286 INFO L87 Difference]: Start difference. First operand 638 states and 1517 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-18 20:08:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:28,038 INFO L93 Difference]: Finished difference Result 643 states and 1535 transitions. [2022-11-18 20:08:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:08:28,039 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-18 20:08:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:28,044 INFO L225 Difference]: With dead ends: 643 [2022-11-18 20:08:28,045 INFO L226 Difference]: Without dead ends: 643 [2022-11-18 20:08:28,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=137, Invalid=571, Unknown=2, NotChecked=102, Total=812 [2022-11-18 20:08:28,054 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:28,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 392 Invalid, 0 Unknown, 188 Unchecked, 1.1s Time] [2022-11-18 20:08:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-11-18 20:08:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 638. [2022-11-18 20:08:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 628 states have (on average 2.4156050955414012) internal successors, (1517), 637 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1517 transitions. [2022-11-18 20:08:28,076 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1517 transitions. Word has length 15 [2022-11-18 20:08:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:28,076 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1517 transitions. [2022-11-18 20:08:28,076 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-18 20:08:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1517 transitions. [2022-11-18 20:08:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:08:28,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:28,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:28,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:08:28,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-18 20:08:28,285 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-18 20:08:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:28,286 INFO L85 PathProgramCache]: Analyzing trace with hash -675367111, now seen corresponding path program 5 times [2022-11-18 20:08:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:28,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882920900] [2022-11-18 20:08:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:28,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:29,885 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-18 20:08:29,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:29,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882920900] [2022-11-18 20:08:29,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882920900] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:29,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497173393] [2022-11-18 20:08:29,887 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:08:29,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:29,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:29,888 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:29,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:08:30,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:08:30,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:08:30,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:08:30,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:30,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:30,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:30,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:30,197 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:08:30,197 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-18 20:08:30,274 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:08:30,275 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:08:30,787 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-18 20:08:31,191 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-18 20:08:31,711 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-18 20:08:31,898 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-18 20:08:32,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:32,077 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-18 20:08:32,245 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-18 20:08:32,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:32,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1854 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1854) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1854 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1854) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-18 20:08:35,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:35,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-18 20:08:45,174 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-18 20:08:45,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497173393] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:45,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:08:45,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:08:45,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282710048] [2022-11-18 20:08:45,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:45,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:08:45,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:45,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:08:45,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=602, Unknown=24, NotChecked=52, Total=812 [2022-11-18 20:08:45,177 INFO L87 Difference]: Start difference. First operand 638 states and 1517 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-18 20:08:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:46,570 INFO L93 Difference]: Finished difference Result 787 states and 1858 transitions. [2022-11-18 20:08:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:08:46,571 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-18 20:08:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:46,573 INFO L225 Difference]: With dead ends: 787 [2022-11-18 20:08:46,574 INFO L226 Difference]: Without dead ends: 787 [2022-11-18 20:08:46,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=177, Invalid=859, Unknown=24, NotChecked=62, Total=1122 [2022-11-18 20:08:46,575 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:46,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 128 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 333 Unchecked, 0.5s Time] [2022-11-18 20:08:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-11-18 20:08:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 639. [2022-11-18 20:08:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 629 states have (on average 2.414944356120827) internal successors, (1519), 638 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1519 transitions. [2022-11-18 20:08:46,593 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1519 transitions. Word has length 15 [2022-11-18 20:08:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:46,594 INFO L495 AbstractCegarLoop]: Abstraction has 639 states and 1519 transitions. [2022-11-18 20:08:46,594 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-18 20:08:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1519 transitions. [2022-11-18 20:08:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:08:46,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:46,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:46,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:08:46,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:46,803 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-18 20:08:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash -675597751, now seen corresponding path program 6 times [2022-11-18 20:08:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:46,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590840482] [2022-11-18 20:08:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:48,242 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-18 20:08:48,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:48,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590840482] [2022-11-18 20:08:48,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590840482] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:48,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576168355] [2022-11-18 20:08:48,243 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:08:48,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:48,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:48,244 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:48,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:08:48,505 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-18 20:08:48,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:08:48,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 20:08:48,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:48,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:48,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:48,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:48,575 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:08:48,576 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-18 20:08:48,634 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:08:48,634 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:08:49,073 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-18 20:08:49,395 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-18 20:08:49,834 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-18 20:08:49,986 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-18 20:08:50,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:50,175 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-18 20:08:50,303 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-18 20:08:50,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:50,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-18 20:08:50,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1951 (Array Int Int)) (v_ArrVal_1950 (Array Int Int))) (< (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1950) |c_~#stored_elements~0.base| v_ArrVal_1951) |c_~#queue~0.base|) .cse0)) 1605)) (forall ((v_ArrVal_1951 (Array Int Int)) (v_ArrVal_1950 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1950) |c_~#stored_elements~0.base| v_ArrVal_1951) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:08:50,950 WARN L837 $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_1951 (Array Int Int)) (v_ArrVal_1950 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1950) |c_~#stored_elements~0.base| v_ArrVal_1951) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1951 (Array Int Int)) (v_ArrVal_1950 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1950) |c_~#stored_elements~0.base| v_ArrVal_1951) |c_~#queue~0.base|) .cse1) 4) 1605)))) is different from false [2022-11-18 20:08:58,330 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-18 20:08:58,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576168355] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:58,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:08:58,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-18 20:08:58,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983803525] [2022-11-18 20:08:58,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:58,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:08:58,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:58,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:08:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=468, Unknown=34, NotChecked=94, Total=702 [2022-11-18 20:08:58,332 INFO L87 Difference]: Start difference. First operand 639 states and 1519 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-18 20:09:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:05,763 INFO L93 Difference]: Finished difference Result 778 states and 1855 transitions. [2022-11-18 20:09:05,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:09:05,764 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-18 20:09:05,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:05,766 INFO L225 Difference]: With dead ends: 778 [2022-11-18 20:09:05,766 INFO L226 Difference]: Without dead ends: 778 [2022-11-18 20:09:05,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=295, Invalid=1478, Unknown=41, NotChecked=166, Total=1980 [2022-11-18 20:09:05,768 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 605 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:05,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 173 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 462 Invalid, 0 Unknown, 605 Unchecked, 1.3s Time] [2022-11-18 20:09:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-18 20:09:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 640. [2022-11-18 20:09:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 630 states have (on average 2.4174603174603173) internal successors, (1523), 639 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1523 transitions. [2022-11-18 20:09:05,786 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1523 transitions. Word has length 15 [2022-11-18 20:09:05,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:05,786 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 1523 transitions. [2022-11-18 20:09:05,787 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-18 20:09:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1523 transitions. [2022-11-18 20:09:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:09:05,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:05,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:05,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-18 20:09:05,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:05,995 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-18 20:09:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash -675741901, now seen corresponding path program 7 times [2022-11-18 20:09:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:05,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999779970] [2022-11-18 20:09:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:07,504 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-18 20:09:07,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999779970] [2022-11-18 20:09:07,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999779970] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:07,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145857427] [2022-11-18 20:09:07,505 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:09:07,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:07,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:07,507 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:07,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:09:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:07,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 20:09:07,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:07,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:07,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:07,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:07,803 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:09:07,804 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-18 20:09:07,889 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:09:07,890 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:09:08,313 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-18 20:09:08,738 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-18 20:09:09,170 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-18 20:09:09,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:09,349 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-18 20:09:09,511 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-18 20:09:09,670 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-18 20:09:09,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:09,950 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2047) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2048) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2047) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2048) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:09:16,375 WARN L837 $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_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2047) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2048) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2047) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2048) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:09:18,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:18,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-18 20:09:27,339 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:09:27,424 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse3)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1303| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1303| .cse0)) (forall ((v_ArrVal_2042 Int) (v_prenex_33 Int) (v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int))) (< (* (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_1303| 4)) v_ArrVal_2042))) (store (store .cse1 .cse2 v_prenex_33) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_35) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_34) |c_~#queue~0.base|) .cse3) 4) 1609)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1303| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1303| .cse0)) (forall ((v_ArrVal_2042 Int) (v_ArrVal_2044 Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (<= 0 (+ (* 4 (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_1303| 4)) v_ArrVal_2042))) (store (store .cse5 .cse2 v_ArrVal_2044) .cse3 (+ (select .cse5 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2047) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2048) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|)))))))) is different from false [2022-11-18 20:09:27,525 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-18 20:09:27,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145857427] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:27,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:27,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:09:27,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571589933] [2022-11-18 20:09:27,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:27,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:09:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:27,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:09:27,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=516, Unknown=24, NotChecked=150, Total=812 [2022-11-18 20:09:27,528 INFO L87 Difference]: Start difference. First operand 640 states and 1523 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-18 20:09:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:30,964 INFO L93 Difference]: Finished difference Result 946 states and 2253 transitions. [2022-11-18 20:09:30,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:09:30,965 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-18 20:09:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:30,967 INFO L225 Difference]: With dead ends: 946 [2022-11-18 20:09:30,968 INFO L226 Difference]: Without dead ends: 946 [2022-11-18 20:09:30,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=206, Invalid=838, Unknown=24, NotChecked=192, Total=1260 [2022-11-18 20:09:30,969 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 232 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 601 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:30,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 132 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 362 Invalid, 0 Unknown, 601 Unchecked, 1.1s Time] [2022-11-18 20:09:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2022-11-18 20:09:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 640. [2022-11-18 20:09:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 630 states have (on average 2.4174603174603173) internal successors, (1523), 639 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1523 transitions. [2022-11-18 20:09:30,988 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1523 transitions. Word has length 15 [2022-11-18 20:09:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:30,988 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 1523 transitions. [2022-11-18 20:09:30,989 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-18 20:09:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1523 transitions. [2022-11-18 20:09:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:09:30,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:30,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:31,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:31,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:31,197 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:09:31,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2110485635, now seen corresponding path program 8 times [2022-11-18 20:09:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:31,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399719092] [2022-11-18 20:09:31,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:32,457 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-18 20:09:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399719092] [2022-11-18 20:09:32,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399719092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:32,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719068262] [2022-11-18 20:09:32,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:09:32,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:32,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:32,460 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:32,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:09:32,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:09:32,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:09:32,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:09:32,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:32,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:32,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:32,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:32,773 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:09:32,773 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-18 20:09:32,824 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:09:32,825 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:09:33,156 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-18 20:09:33,333 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 35 treesize of output 37 [2022-11-18 20:09:33,561 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-18 20:09:34,064 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-18 20:09:34,218 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-18 20:09:34,354 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-18 20:09:34,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:34,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-11-18 20:09:34,480 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2145 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2145) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2145 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2145) |c_~#queue~0.base|) .cse0) 4) 1605)))) is different from false [2022-11-18 20:09:34,503 WARN L837 $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_2145 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2145) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2145 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2145) |c_~#queue~0.base|) .cse1) 4) 1605)))) is different from false [2022-11-18 20:09:38,117 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-18 20:09:38,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719068262] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:38,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:38,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-18 20:09:38,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290214155] [2022-11-18 20:09:38,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:38,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:09:38,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:38,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:09:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=486, Unknown=14, NotChecked=94, Total=702 [2022-11-18 20:09:38,120 INFO L87 Difference]: Start difference. First operand 640 states and 1523 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-18 20:09:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:42,782 INFO L93 Difference]: Finished difference Result 787 states and 1897 transitions. [2022-11-18 20:09:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:09:42,783 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-18 20:09:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:42,785 INFO L225 Difference]: With dead ends: 787 [2022-11-18 20:09:42,785 INFO L226 Difference]: Without dead ends: 787 [2022-11-18 20:09:42,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=316, Invalid=1653, Unknown=19, NotChecked=174, Total=2162 [2022-11-18 20:09:42,786 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:42,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 131 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 319 Invalid, 0 Unknown, 449 Unchecked, 0.9s Time] [2022-11-18 20:09:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-11-18 20:09:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 637. [2022-11-18 20:09:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 627 states have (on average 2.4098883572567784) internal successors, (1511), 636 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1511 transitions. [2022-11-18 20:09:42,804 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1511 transitions. Word has length 15 [2022-11-18 20:09:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:42,804 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 1511 transitions. [2022-11-18 20:09:42,804 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-18 20:09:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1511 transitions. [2022-11-18 20:09:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:09:42,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:42,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:42,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-18 20:09:43,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-18 20:09:43,013 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-18 20:09:43,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2027974175, now seen corresponding path program 9 times [2022-11-18 20:09:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:43,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844790135] [2022-11-18 20:09:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:44,298 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-18 20:09:44,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:44,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844790135] [2022-11-18 20:09:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844790135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:44,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894377076] [2022-11-18 20:09:44,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:09:44,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:44,300 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:44,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 20:09:44,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:09:44,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:09:44,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:09:44,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:44,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:44,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:44,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:44,625 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:09:44,625 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-18 20:09:44,681 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:09:44,681 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:09:45,009 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-18 20:09:45,183 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 35 treesize of output 37 [2022-11-18 20:09:45,518 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-18 20:09:45,992 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-18 20:09:46,143 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-18 20:09:46,318 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-18 20:09:46,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:46,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2242 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2242) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2242 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2242) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:09:46,446 WARN L837 $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_2242 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2242) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2242 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2242) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:09:46,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:46,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-18 20:09:57,497 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:10:09,426 WARN L233 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:10:15,680 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:10:16,113 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-18 20:10:16,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894377076] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:10:16,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:10:16,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:10:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629701522] [2022-11-18 20:10:16,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:10:16,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:10:16,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:10:16,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:10:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=564, Unknown=20, NotChecked=102, Total=812 [2022-11-18 20:10:16,115 INFO L87 Difference]: Start difference. First operand 637 states and 1511 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-18 20:10:25,423 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 79 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:10:52,840 WARN L233 SmtUtils]: Spent 26.98s on a formula simplification. DAG size of input: 91 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:10:52,928 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse14 (select .cse6 .cse3))) (let ((.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ .cse14 1)) (.cse12 (* (select .cse15 .cse4) 4)) (.cse13 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~#id2~0#1.base| 4)) (.cse11 (<= (select |c_#length| |c_ULTIMATE.start_main_~#id2~0#1.base|) 4))) (and (forall ((v_prenex_37 Int) (v_ArrVal_2237 (Array Int Int)) (v_prenex_36 (Array Int Int))) (< (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2237))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_prenex_37) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_36) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) .cse5)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_37 Int) (v_prenex_36 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse2 v_prenex_37) .cse3 .cse7)) |c_~#stored_elements~0.base| v_prenex_36) |c_~#queue~0.base|) .cse4) 4)) .cse5)) (forall ((v_ArrVal_2237 (Array Int Int)) (v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2239 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2237))) (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse9 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse9 .cse2 v_ArrVal_2239) .cse3 (+ (select .cse9 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2242) |c_~#queue~0.base|) .cse4) 4)))) (= |c_~#queue~0.offset| 0) (or (not .cse10) .cse11) (<= (+ .cse12 |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (forall ((v_ArrVal_2242 (Array Int Int)) (v_ArrVal_2239 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse2 v_ArrVal_2239) .cse3 .cse7)) |c_~#stored_elements~0.base| v_ArrVal_2242) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= 0 (+ .cse12 |c_~#queue~0.offset|)) (or .cse13 (= .cse14 0)) (= (select .cse15 1604) 0) (= |c_~#queue~0.base| 4) (or (not .cse13) (and .cse10 .cse11)))))) is different from false [2022-11-18 20:10:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:10:53,665 INFO L93 Difference]: Finished difference Result 1055 states and 2500 transitions. [2022-11-18 20:10:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:10:53,666 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-18 20:10:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:10:53,669 INFO L225 Difference]: With dead ends: 1055 [2022-11-18 20:10:53,669 INFO L226 Difference]: Without dead ends: 1055 [2022-11-18 20:10:53,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=212, Invalid=883, Unknown=39, NotChecked=198, Total=1332 [2022-11-18 20:10:53,670 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 223 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 738 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:10:53,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 137 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 738 Unchecked, 0.6s Time] [2022-11-18 20:10:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-11-18 20:10:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 630. [2022-11-18 20:10:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 620 states have (on average 2.420967741935484) internal successors, (1501), 629 states have internal predecessors, (1501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:10:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1501 transitions. [2022-11-18 20:10:53,689 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1501 transitions. Word has length 15 [2022-11-18 20:10:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:10:53,689 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 1501 transitions. [2022-11-18 20:10:53,689 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-18 20:10:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1501 transitions. [2022-11-18 20:10:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:10:53,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:10:53,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:10:53,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:10:53,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-18 20:10:53,898 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-18 20:10:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:10:53,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2028204815, now seen corresponding path program 10 times [2022-11-18 20:10:53,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:10:53,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686507954] [2022-11-18 20:10:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:10:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:10:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:10:55,261 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-18 20:10:55,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:10:55,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686507954] [2022-11-18 20:10:55,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686507954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:10:55,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273420636] [2022-11-18 20:10:55,262 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:10:55,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:10:55,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:10:55,263 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:10:55,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-18 20:10:55,492 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:10:55,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:10:55,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:10:55,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:10:55,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:55,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:55,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:55,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:10:55,568 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:10:55,568 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-18 20:10:55,626 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:10:55,626 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:10:55,952 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-18 20:10:56,131 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 35 treesize of output 37 [2022-11-18 20:10:56,488 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-18 20:10:56,949 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-18 20:10:57,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:57,176 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-18 20:10:57,317 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-18 20:10:57,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:10:57,620 WARN L837 $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_2339 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2339) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_2339 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2339) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:10:57,646 WARN L837 $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_2339 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2339) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2339 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2339) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:10:57,690 WARN L837 $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_2339 (Array Int Int)) (v_ArrVal_2335 Int)) (<= (+ (* (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_2339) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2339 (Array Int Int)) (v_ArrVal_2335 Int)) (<= 0 (+ (* (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_2339) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:10:57,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:57,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-18 20:11:08,952 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:11:19,888 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:11:20,303 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-18 20:11:20,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273420636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:11:20,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:11:20,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:11:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428175886] [2022-11-18 20:11:20,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:20,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:11:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:20,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:11:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=532, Unknown=13, NotChecked=150, Total=812 [2022-11-18 20:11:20,305 INFO L87 Difference]: Start difference. First operand 630 states and 1501 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-18 20:11:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:27,371 INFO L93 Difference]: Finished difference Result 895 states and 2133 transitions. [2022-11-18 20:11:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:11:27,372 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-18 20:11:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:27,374 INFO L225 Difference]: With dead ends: 895 [2022-11-18 20:11:27,375 INFO L226 Difference]: Without dead ends: 895 [2022-11-18 20:11:27,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=193, Invalid=862, Unknown=13, NotChecked=192, Total=1260 [2022-11-18 20:11:27,376 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 132 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 856 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:27,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 189 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 385 Invalid, 0 Unknown, 856 Unchecked, 1.1s Time] [2022-11-18 20:11:27,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-18 20:11:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 621. [2022-11-18 20:11:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 611 states have (on average 2.414075286415712) internal successors, (1475), 620 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:11:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1475 transitions. [2022-11-18 20:11:27,393 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1475 transitions. Word has length 15 [2022-11-18 20:11:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:27,393 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 1475 transitions. [2022-11-18 20:11:27,394 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-18 20:11:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1475 transitions. [2022-11-18 20:11:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:11:27,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:27,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:27,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:27,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:27,603 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:11:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2014977094, now seen corresponding path program 1 times [2022-11-18 20:11:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:27,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350377510] [2022-11-18 20:11:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:11:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:27,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350377510] [2022-11-18 20:11:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350377510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:27,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:11:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253878699] [2022-11-18 20:11:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:11:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:11:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:11:27,747 INFO L87 Difference]: Start difference. First operand 621 states and 1475 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-18 20:11:28,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:28,051 INFO L93 Difference]: Finished difference Result 633 states and 1483 transitions. [2022-11-18 20:11:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:11:28,052 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-18 20:11:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:28,053 INFO L225 Difference]: With dead ends: 633 [2022-11-18 20:11:28,054 INFO L226 Difference]: Without dead ends: 633 [2022-11-18 20:11:28,054 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-18 20:11:28,054 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:28,055 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.3s Time] [2022-11-18 20:11:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-11-18 20:11:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 607. [2022-11-18 20:11:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 597 states have (on average 2.408710217755444) internal successors, (1438), 606 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:11:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1438 transitions. [2022-11-18 20:11:28,070 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1438 transitions. Word has length 15 [2022-11-18 20:11:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:28,070 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 1438 transitions. [2022-11-18 20:11:28,070 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-18 20:11:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1438 transitions. [2022-11-18 20:11:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:11:28,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:28,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:28,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-18 20:11:28,072 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-18 20:11:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:28,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1651969010, now seen corresponding path program 1 times [2022-11-18 20:11:28,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:28,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076176475] [2022-11-18 20:11:28,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:28,190 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-18 20:11:28,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:28,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076176475] [2022-11-18 20:11:28,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076176475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:28,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:28,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:11:28,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323243360] [2022-11-18 20:11:28,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:28,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:11:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:11:28,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:11:28,195 INFO L87 Difference]: Start difference. First operand 607 states and 1438 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-18 20:11:28,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:28,455 INFO L93 Difference]: Finished difference Result 377 states and 753 transitions. [2022-11-18 20:11:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:11:28,455 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-18 20:11:28,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:28,456 INFO L225 Difference]: With dead ends: 377 [2022-11-18 20:11:28,456 INFO L226 Difference]: Without dead ends: 375 [2022-11-18 20:11:28,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:11:28,457 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 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.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:28,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:11:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-18 20:11:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2022-11-18 20:11:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 353 states have (on average 2.087818696883853) internal successors, (737), 362 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:11:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 737 transitions. [2022-11-18 20:11:28,464 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 737 transitions. Word has length 16 [2022-11-18 20:11:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:28,465 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 737 transitions. [2022-11-18 20:11:28,465 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-18 20:11:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 737 transitions. [2022-11-18 20:11:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:11:28,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:28,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:28,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-18 20:11:28,466 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-18 20:11:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:28,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1651968049, now seen corresponding path program 1 times [2022-11-18 20:11:28,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:28,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764575943] [2022-11-18 20:11:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:28,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:30,493 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-18 20:11:30,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:30,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764575943] [2022-11-18 20:11:30,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764575943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:30,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3901099] [2022-11-18 20:11:30,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:30,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:30,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:30,495 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:30,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-18 20:11:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:30,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:11:30,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:30,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:30,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:30,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:30,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:11:30,866 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:11:30,866 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-18 20:11:30,933 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:11:30,934 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:11:31,365 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-18 20:11:31,799 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 35 treesize of output 37 [2022-11-18 20:11:31,992 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-18 20:11:32,478 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-18 20:11:32,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:32,631 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-18 20:11:32,786 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-18 20:11:32,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:33,581 WARN L837 $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_2508 Int) (v_ArrVal_2512 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2508) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2512) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2508 Int) (v_ArrVal_2512 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2508) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2512) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-18 20:11:33,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2508 Int) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2507))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_2508) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2512) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_2508 Int) (v_ArrVal_2512 (Array Int Int)) (v_ArrVal_2507 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2507))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_2508) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2512) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:11:33,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:11:33,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 113 [2022-11-18 20:11:49,618 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-18 20:11:49,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3901099] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:11:49,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:11:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:11:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556029284] [2022-11-18 20:11:49,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:49,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:11:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:49,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:11:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=543, Unknown=41, NotChecked=102, Total=812 [2022-11-18 20:11:49,624 INFO L87 Difference]: Start difference. First operand 363 states and 737 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:11:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:54,573 INFO L93 Difference]: Finished difference Result 416 states and 829 transitions. [2022-11-18 20:11:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:11:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:11:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:54,575 INFO L225 Difference]: With dead ends: 416 [2022-11-18 20:11:54,575 INFO L226 Difference]: Without dead ends: 416 [2022-11-18 20:11:54,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=239, Invalid=1059, Unknown=42, NotChecked=142, Total=1482 [2022-11-18 20:11:54,575 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 67 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:54,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 73 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 352 Invalid, 0 Unknown, 702 Unchecked, 0.9s Time] [2022-11-18 20:11:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-18 20:11:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 353. [2022-11-18 20:11:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 343 states have (on average 2.0903790087463556) internal successors, (717), 352 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:11:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 717 transitions. [2022-11-18 20:11:54,581 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 717 transitions. Word has length 16 [2022-11-18 20:11:54,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:54,581 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 717 transitions. [2022-11-18 20:11:54,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:11:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 717 transitions. [2022-11-18 20:11:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:11:54,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:54,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:54,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-18 20:11:54,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:54,789 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-18 20:11:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 106645727, now seen corresponding path program 2 times [2022-11-18 20:11:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:54,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510305948] [2022-11-18 20:11:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:56,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-18 20:11:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510305948] [2022-11-18 20:11:56,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510305948] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781922484] [2022-11-18 20:11:56,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:11:56,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:56,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:56,346 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:56,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-18 20:11:56,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:11:56,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:11:56,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:11:56,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:56,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:56,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:56,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:11:56,683 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:11:56,684 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-18 20:11:56,735 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:11:56,736 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:11:57,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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-18 20:11:57,440 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-18 20:11:57,686 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-18 20:11:58,169 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-18 20:11:58,314 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-18 20:11:58,466 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-18 20:11:58,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:59,260 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2606))) (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_2609) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2606 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2606))) (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_2609) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:11:59,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:11:59,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 163 [2022-11-18 20:12:01,828 WARN L837 $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_2609 (Array Int Int)) (v_ArrVal_2604 Int) (v_ArrVal_2606 (Array Int Int))) (< (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2604)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2606))) (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_2609) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_43 (Array Int Int)) (v_prenex_44 Int) (v_prenex_45 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_prenex_44)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_45))) (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_prenex_43) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:12:19,224 WARN L233 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:12:28,059 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-18 20:12:28,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781922484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:28,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:28,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:12:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108596504] [2022-11-18 20:12:28,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:28,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:12:28,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:12:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=532, Unknown=51, NotChecked=102, Total=812 [2022-11-18 20:12:28,061 INFO L87 Difference]: Start difference. First operand 353 states and 717 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:12:37,253 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 99 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:12:37,368 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse3 .cse2)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (or (forall ((v_ArrVal_2603 Int) (v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2604 Int) (v_ArrVal_2606 (Array Int Int))) (< (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2603) .cse4 v_ArrVal_2604)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2606))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 .cse2 (+ 1 (select .cse1 .cse2)))))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|) .cse2) 4) 1609)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| .cse5)))) (forall ((v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2604 Int) (v_ArrVal_2606 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_2604)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2606))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| Int)) (or (forall ((v_prenex_43 (Array Int Int)) (v_prenex_44 Int) (v_prenex_45 (Array Int Int)) (v_ArrVal_2603 Int)) (<= 0 (+ (* (select (select (store (let ((.cse11 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| 4) |c_~#queue~0.offset|) v_ArrVal_2603) .cse4 v_prenex_44)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_45))) (store .cse11 |c_~#queue~0.base| (let ((.cse12 (select .cse11 |c_~#queue~0.base|))) (store .cse12 .cse2 (+ (select .cse12 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_43) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1323| .cse5)))) (forall ((v_ArrVal_2609 (Array Int Int)) (v_ArrVal_2604 Int) (v_ArrVal_2606 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_2604)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2606))) (store .cse13 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse14 (select .cse13 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse14 .cse8 (+ (select .cse14 .cse8) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2609) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-18 20:12:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:37,679 INFO L93 Difference]: Finished difference Result 430 states and 848 transitions. [2022-11-18 20:12:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:12:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:12:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:37,680 INFO L225 Difference]: With dead ends: 430 [2022-11-18 20:12:37,681 INFO L226 Difference]: Without dead ends: 430 [2022-11-18 20:12:37,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=189, Invalid=827, Unknown=52, NotChecked=192, Total=1260 [2022-11-18 20:12:37,682 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:37,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 59 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 362 Unchecked, 0.4s Time] [2022-11-18 20:12:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-18 20:12:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 351. [2022-11-18 20:12:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 341 states have (on average 2.090909090909091) internal successors, (713), 350 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 713 transitions. [2022-11-18 20:12:37,691 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 713 transitions. Word has length 16 [2022-11-18 20:12:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:37,691 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 713 transitions. [2022-11-18 20:12:37,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:12:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 713 transitions. [2022-11-18 20:12:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:12:37,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:37,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:37,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-18 20:12:37,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-18 20:12:37,899 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-18 20:12:37,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2047108583, now seen corresponding path program 3 times [2022-11-18 20:12:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:37,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477347783] [2022-11-18 20:12:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:39,107 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-18 20:12:39,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:39,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477347783] [2022-11-18 20:12:39,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477347783] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:39,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647089590] [2022-11-18 20:12:39,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:12:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:39,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:39,109 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:39,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-18 20:12:39,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:12:39,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:39,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:12:39,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:39,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,487 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:12:39,487 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-18 20:12:39,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,510 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-18 20:12:39,563 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:12:39,563 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:12:39,888 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-18 20:12:40,110 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-18 20:12:40,339 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:12:40,589 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 42 treesize of output 38 [2022-11-18 20:12:40,719 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 45 treesize of output 47 [2022-11-18 20:12:40,859 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-18 20:12:40,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:40,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2707 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2707) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2707 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2707) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:12:40,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:40,971 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 28 treesize of output 29 [2022-11-18 20:12:40,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:40,996 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 46 treesize of output 45 [2022-11-18 20:12:41,033 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 11 treesize of output 7 [2022-11-18 20:12:41,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:41,048 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 31 treesize of output 32 [2022-11-18 20:12:41,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:12:41,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:41,059 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 29 treesize of output 17 [2022-11-18 20:12:49,987 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| Int)) (or (forall ((v_ArrVal_2701 Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| 4) |c_~#queue~0.offset|) v_ArrVal_2701) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| .cse2)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| Int)) (or (forall ((v_ArrVal_2701 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| 4) |c_~#queue~0.offset|) v_ArrVal_2701) .cse1) 4) 4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| .cse2))))))) is different from false [2022-11-18 20:12:50,101 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-18 20:12:50,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647089590] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:50,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:50,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 21 [2022-11-18 20:12:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991319025] [2022-11-18 20:12:50,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:50,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:12:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:12:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=334, Unknown=2, NotChecked=78, Total=506 [2022-11-18 20:12:50,104 INFO L87 Difference]: Start difference. First operand 351 states and 713 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 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-18 20:12:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:51,138 INFO L93 Difference]: Finished difference Result 356 states and 724 transitions. [2022-11-18 20:12:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:12:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 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-18 20:12:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:51,140 INFO L225 Difference]: With dead ends: 356 [2022-11-18 20:12:51,140 INFO L226 Difference]: Without dead ends: 356 [2022-11-18 20:12:51,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=105, Invalid=363, Unknown=2, NotChecked=82, Total=552 [2022-11-18 20:12:51,141 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:51,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 294 Invalid, 0 Unknown, 153 Unchecked, 0.8s Time] [2022-11-18 20:12:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-11-18 20:12:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 349. [2022-11-18 20:12:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 339 states have (on average 2.0914454277286136) internal successors, (709), 348 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 709 transitions. [2022-11-18 20:12:51,149 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 709 transitions. Word has length 16 [2022-11-18 20:12:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:51,150 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 709 transitions. [2022-11-18 20:12:51,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 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-18 20:12:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 709 transitions. [2022-11-18 20:12:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:12:51,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:51,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:51,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:51,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-18 20:12:51,364 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:12:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2047130903, now seen corresponding path program 4 times [2022-11-18 20:12:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:51,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647755780] [2022-11-18 20:12:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:52,388 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-18 20:12:52,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647755780] [2022-11-18 20:12:52,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647755780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079320515] [2022-11-18 20:12:52,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:12:52,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:52,391 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:52,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-18 20:12:52,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:12:52,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:52,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-18 20:12:52,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:52,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:52,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:52,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:52,719 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:12:52,720 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-18 20:12:52,748 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:12:52,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:12:53,029 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-18 20:12:53,363 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-18 20:12:53,605 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:12:53,841 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 42 treesize of output 38 [2022-11-18 20:12:54,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:54,028 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 45 treesize of output 47 [2022-11-18 20:12:54,129 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-18 20:12:54,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:54,217 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2802 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2802) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_2802 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2802) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:12:54,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:54,247 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 28 treesize of output 29 [2022-11-18 20:12:54,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:54,273 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 46 treesize of output 45 [2022-11-18 20:12:54,284 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 11 treesize of output 7 [2022-11-18 20:12:54,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:54,327 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 31 treesize of output 32 [2022-11-18 20:12:54,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:12:54,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:54,354 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 29 treesize of output 17 [2022-11-18 20:12:54,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:54,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-11-18 20:12:57,065 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse0 .cse1))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1331| Int)) (or (forall ((v_ArrVal_2796 Int)) (<= 0 (+ (* (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1331| 4)) v_ArrVal_2796) .cse1) 4) |c_~#queue~0.offset| 4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1331| .cse2)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1331| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1331| .cse2)) (forall ((v_ArrVal_2796 Int)) (< (* (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1331| 4)) v_ArrVal_2796) .cse1) 4) 1605))))))) is different from false [2022-11-18 20:12:57,173 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-18 20:12:57,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079320515] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:57,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:57,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2022-11-18 20:12:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306612193] [2022-11-18 20:12:57,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:57,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:12:57,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:12:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=412, Unknown=2, NotChecked=86, Total=600 [2022-11-18 20:12:57,175 INFO L87 Difference]: Start difference. First operand 349 states and 709 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-18 20:12:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:58,776 INFO L93 Difference]: Finished difference Result 359 states and 729 transitions. [2022-11-18 20:12:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:12:58,777 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-18 20:12:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:58,777 INFO L225 Difference]: With dead ends: 359 [2022-11-18 20:12:58,777 INFO L226 Difference]: Without dead ends: 359 [2022-11-18 20:12:58,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=129, Invalid=527, Unknown=2, NotChecked=98, Total=756 [2022-11-18 20:12:58,779 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:58,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 65 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 376 Invalid, 0 Unknown, 249 Unchecked, 1.1s Time] [2022-11-18 20:12:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-18 20:12:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2022-11-18 20:12:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 340 states have (on average 2.0911764705882354) internal successors, (711), 349 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:12:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 711 transitions. [2022-11-18 20:12:58,787 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 711 transitions. Word has length 16 [2022-11-18 20:12:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:58,787 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 711 transitions. [2022-11-18 20:12:58,787 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-18 20:12:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 711 transitions. [2022-11-18 20:12:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:12:58,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:58,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:58,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-18 20:12:58,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:58,995 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:12:58,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2050561673, now seen corresponding path program 5 times [2022-11-18 20:12:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:58,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038367358] [2022-11-18 20:12:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:59,992 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-18 20:12:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:59,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038367358] [2022-11-18 20:12:59,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038367358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850224511] [2022-11-18 20:12:59,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:12:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:59,995 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:59,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-18 20:13:00,259 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:13:00,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:13:00,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-18 20:13:00,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:00,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:00,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:00,375 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-18 20:13:00,375 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-18 20:13:00,412 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:13:00,413 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-18 20:13:00,921 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-18 20:13:00,968 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:13:00,969 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-18 20:13:01,329 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-18 20:13:01,582 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:13:01,986 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 42 treesize of output 38 [2022-11-18 20:13:02,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:02,148 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 45 treesize of output 47 [2022-11-18 20:13:02,279 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-18 20:13:02,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:02,377 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2898 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2898) |c_~#queue~0.base|) .cse0)) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2898 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2898) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-18 20:13:02,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:02,398 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 31 treesize of output 32 [2022-11-18 20:13:02,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:02,428 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 52 treesize of output 51 [2022-11-18 20:13:02,474 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-18 20:13:02,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:02,490 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 28 treesize of output 29 [2022-11-18 20:13:02,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:02,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:02,501 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 26 treesize of output 14 [2022-11-18 20:13:09,308 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:13:13,694 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-18 20:13:13,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850224511] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:13,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:13,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2022-11-18 20:13:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597159967] [2022-11-18 20:13:13,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:13,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:13:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:13,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:13:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=448, Unknown=1, NotChecked=44, Total=600 [2022-11-18 20:13:13,697 INFO L87 Difference]: Start difference. First operand 350 states and 711 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-18 20:13:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:15,214 INFO L93 Difference]: Finished difference Result 357 states and 725 transitions. [2022-11-18 20:13:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:13:15,215 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-18 20:13:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:15,215 INFO L225 Difference]: With dead ends: 357 [2022-11-18 20:13:15,215 INFO L226 Difference]: Without dead ends: 357 [2022-11-18 20:13:15,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=149, Invalid=666, Unknown=1, NotChecked=54, Total=870 [2022-11-18 20:13:15,217 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:15,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 124 Unchecked, 0.7s Time] [2022-11-18 20:13:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-18 20:13:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 348. [2022-11-18 20:13:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 338 states have (on average 2.091715976331361) internal successors, (707), 347 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 707 transitions. [2022-11-18 20:13:15,223 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 707 transitions. Word has length 16 [2022-11-18 20:13:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:15,224 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 707 transitions. [2022-11-18 20:13:15,224 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-18 20:13:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 707 transitions. [2022-11-18 20:13:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:13:15,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:15,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:15,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-18 20:13:15,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-18 20:13:15,431 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:13:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash 538452307, now seen corresponding path program 6 times [2022-11-18 20:13:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:15,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826535302] [2022-11-18 20:13:15,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:15,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:17,795 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-18 20:13:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:17,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826535302] [2022-11-18 20:13:17,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826535302] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:17,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636553262] [2022-11-18 20:13:17,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:13:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:17,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:17,797 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:17,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-18 20:13:18,092 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-18 20:13:18,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:13:18,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-18 20:13:18,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:18,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:18,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:18,164 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:13:18,164 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-18 20:13:18,229 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-18 20:13:18,230 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-18 20:13:18,599 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-18 20:13:18,959 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-18 20:13:19,438 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-18 20:13:19,622 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-18 20:13:19,789 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-18 20:13:20,014 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-18 20:13:20,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:20,151 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2995 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2995 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:13:20,183 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:13:20,208 WARN L837 $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_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:13:20,235 WARN L837 $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_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:13:20,293 WARN L837 $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_2991 Int) (v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (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_2991) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2991 Int) (v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (Array Int Int))) (<= (+ (* 4 (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2991) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-18 20:13:20,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:20,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 101 [2022-11-18 20:13:22,415 WARN L837 $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_prenex_46 Int) (v_prenex_47 (Array Int Int)) (v_prenex_48 (Array Int Int))) (< (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_prenex_46) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_48) |c_~#stored_elements~0.base| v_prenex_47) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_2991 Int) (v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 (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_2991) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2994) |c_~#stored_elements~0.base| v_ArrVal_2995) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:13:31,253 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:13:34,126 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-18 20:13:34,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636553262] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:34,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:34,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:13:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087064726] [2022-11-18 20:13:34,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:34,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:13:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:34,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:13:34,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=413, Unknown=10, NotChecked=282, Total=812 [2022-11-18 20:13:34,129 INFO L87 Difference]: Start difference. First operand 348 states and 707 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:13:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:38,314 INFO L93 Difference]: Finished difference Result 372 states and 751 transitions. [2022-11-18 20:13:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:13:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:13:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:38,316 INFO L225 Difference]: With dead ends: 372 [2022-11-18 20:13:38,316 INFO L226 Difference]: Without dead ends: 372 [2022-11-18 20:13:38,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=191, Invalid=815, Unknown=10, NotChecked=390, Total=1406 [2022-11-18 20:13:38,317 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 637 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:38,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 70 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 384 Invalid, 0 Unknown, 637 Unchecked, 1.4s Time] [2022-11-18 20:13:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-18 20:13:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 345. [2022-11-18 20:13:38,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 335 states have (on average 2.0865671641791046) internal successors, (699), 344 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:13:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 699 transitions. [2022-11-18 20:13:38,323 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 699 transitions. Word has length 16 [2022-11-18 20:13:38,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:38,323 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 699 transitions. [2022-11-18 20:13:38,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:13:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 699 transitions. [2022-11-18 20:13:38,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:13:38,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:38,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:38,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-18 20:13:38,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:38,527 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:13:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:38,528 INFO L85 PathProgramCache]: Analyzing trace with hash -371112587, now seen corresponding path program 7 times [2022-11-18 20:13:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:38,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525743671] [2022-11-18 20:13:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:39,791 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-18 20:13:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525743671] [2022-11-18 20:13:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525743671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053721212] [2022-11-18 20:13:39,792 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:13:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:39,793 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:39,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-18 20:13:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:40,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-18 20:13:40,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:40,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:40,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:40,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:40,155 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:13:40,155 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-18 20:13:40,217 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:13:40,217 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:13:40,539 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-18 20:13:40,715 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 35 treesize of output 37 [2022-11-18 20:13:41,117 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-18 20:13:41,616 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-18 20:13:41,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:41,766 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-18 20:13:41,911 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-18 20:13:41,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:42,214 WARN L837 $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_3091 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3091) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_3091 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3091) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:13:42,498 WARN L837 $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_3091 (Array Int Int)) (v_ArrVal_3088 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3088) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_3091) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3088 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3088) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_3091) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:13:42,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:42,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-18 20:13:44,599 WARN L837 $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 (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_50 Int) (v_prenex_49 (Array Int Int))) (< (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_prenex_50) .cse2 .cse3)) |c_~#stored_elements~0.base| v_prenex_49) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3088 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3088) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_3091) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:13:54,374 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-18 20:13:54,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053721212] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:54,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:54,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:13:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971056863] [2022-11-18 20:13:54,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:54,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:13:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:13:54,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=519, Unknown=26, NotChecked=150, Total=812 [2022-11-18 20:13:54,375 INFO L87 Difference]: Start difference. First operand 345 states and 699 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:14:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:02,046 INFO L93 Difference]: Finished difference Result 447 states and 875 transitions. [2022-11-18 20:14:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:14:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:14:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:02,048 INFO L225 Difference]: With dead ends: 447 [2022-11-18 20:14:02,048 INFO L226 Difference]: Without dead ends: 447 [2022-11-18 20:14:02,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=253, Invalid=1132, Unknown=33, NotChecked=222, Total=1640 [2022-11-18 20:14:02,049 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 620 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:02,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 62 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 323 Invalid, 0 Unknown, 620 Unchecked, 0.9s Time] [2022-11-18 20:14:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-11-18 20:14:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 334. [2022-11-18 20:14:02,054 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-18 20:14:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 681 transitions. [2022-11-18 20:14:02,054 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 681 transitions. Word has length 16 [2022-11-18 20:14:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:02,055 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 681 transitions. [2022-11-18 20:14:02,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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-18 20:14:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 681 transitions. [2022-11-18 20:14:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:14:02,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:02,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:02,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:02,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:02,256 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:14:02,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash -144042823, now seen corresponding path program 1 times [2022-11-18 20:14:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:02,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911752830] [2022-11-18 20:14:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:03,325 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-18 20:14:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911752830] [2022-11-18 20:14:03,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911752830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681895684] [2022-11-18 20:14:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:03,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:03,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:03,328 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:03,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-18 20:14:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:03,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:14:03,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:03,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:03,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:03,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:03,644 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-18 20:14:04,177 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-18 20:14:04,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:04,551 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-18 20:14:04,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681895684] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:04,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:04,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2022-11-18 20:14:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992130262] [2022-11-18 20:14:04,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:04,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:14:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:14:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:14:04,553 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-18 20:14:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:07,436 INFO L93 Difference]: Finished difference Result 892 states and 1815 transitions. [2022-11-18 20:14:07,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:14:07,436 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-18 20:14:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:07,438 INFO L225 Difference]: With dead ends: 892 [2022-11-18 20:14:07,438 INFO L226 Difference]: Without dead ends: 892 [2022-11-18 20:14:07,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:14:07,439 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 521 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:07,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 48 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 20:14:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-11-18 20:14:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 562. [2022-11-18 20:14:07,448 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-18 20:14:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1151 transitions. [2022-11-18 20:14:07,462 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1151 transitions. Word has length 19 [2022-11-18 20:14:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:07,462 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1151 transitions. [2022-11-18 20:14:07,462 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-18 20:14:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1151 transitions. [2022-11-18 20:14:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:14:07,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:07,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:07,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:07,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-18 20:14:07,664 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:14:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:07,664 INFO L85 PathProgramCache]: Analyzing trace with hash -678653597, now seen corresponding path program 1 times [2022-11-18 20:14:07,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:07,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460656408] [2022-11-18 20:14:07,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:14:10,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:10,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460656408] [2022-11-18 20:14:10,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460656408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:10,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711773857] [2022-11-18 20:14:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:10,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:10,296 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:10,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-18 20:14:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:10,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:14:10,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:11,393 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-18 20:14:11,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:11,530 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-18 20:14:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:14:11,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:11,753 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_3270 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3270) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_3270 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3270) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:14:11,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:11,769 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-18 20:14:11,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:11,795 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 44 treesize of output 43 [2022-11-18 20:14:11,815 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 11 treesize of output 7 [2022-11-18 20:14:11,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:11,852 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-18 20:14:11,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:14:11,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:11,862 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 27 treesize of output 15 [2022-11-18 20:14:12,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:12,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-11-18 20:14:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-18 20:14:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711773857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:12,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:12,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2022-11-18 20:14:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583639185] [2022-11-18 20:14:12,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 20:14:12,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 20:14:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2022-11-18 20:14:12,633 INFO L87 Difference]: Start difference. First operand 562 states and 1151 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 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-18 20:14:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:18,345 INFO L93 Difference]: Finished difference Result 791 states and 1603 transitions. [2022-11-18 20:14:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:14:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 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-18 20:14:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:18,347 INFO L225 Difference]: With dead ends: 791 [2022-11-18 20:14:18,347 INFO L226 Difference]: Without dead ends: 791 [2022-11-18 20:14:18,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=293, Invalid=900, Unknown=1, NotChecked=66, Total=1260 [2022-11-18 20:14:18,348 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 629 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:18,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 51 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 701 Invalid, 0 Unknown, 94 Unchecked, 2.9s Time] [2022-11-18 20:14:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-18 20:14:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 616. [2022-11-18 20:14:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 606 states have (on average 2.097359735973597) internal successors, (1271), 615 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:14:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1271 transitions. [2022-11-18 20:14:18,360 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1271 transitions. Word has length 21 [2022-11-18 20:14:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:18,361 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 1271 transitions. [2022-11-18 20:14:18,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 23 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-18 20:14:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1271 transitions. [2022-11-18 20:14:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:14:18,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:18,362 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-18 20:14:18,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-18 20:14:18,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:18,570 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:14:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1029172945, now seen corresponding path program 2 times [2022-11-18 20:14:18,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:18,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798282741] [2022-11-18 20:14:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:18,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:20,553 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-18 20:14:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798282741] [2022-11-18 20:14:20,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798282741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880950802] [2022-11-18 20:14:20,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:14:20,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:20,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:20,555 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:20,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-18 20:14:20,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:14:20,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:14:20,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-18 20:14:20,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:20,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:20,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:20,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:20,942 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:14:20,943 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-18 20:14:20,971 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:14:20,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 20:14:21,321 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-18 20:14:21,760 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-18 20:14:22,295 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-18 20:14:22,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:22,482 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-18 20:14:22,782 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 89 treesize of output 82 [2022-11-18 20:14:23,129 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 154 treesize of output 149 [2022-11-18 20:14:23,674 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 124 treesize of output 117 [2022-11-18 20:14:23,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:23,907 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 217 treesize of output 219 [2022-11-18 20:14:24,114 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-18 20:14:24,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:24,399 WARN L837 $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_3383 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_3383 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:14:24,424 WARN L837 $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_3383 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_3383 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:14:27,054 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3378 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_3378))) (store (store .cse0 .cse1 v_ArrVal_3380) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse2) 4)))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3378 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse5 (store .cse3 .cse4 v_ArrVal_3378))) (store (store .cse5 .cse1 v_ArrVal_3380) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-18 20:14:29,091 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_3378)))) (store (store .cse1 .cse2 v_ArrVal_3380) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_3378)))) (store (store .cse6 .cse2 v_ArrVal_3380) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:14:31,130 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.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)))) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_3378)))) (store (store .cse1 .cse2 v_ArrVal_3380) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= (+ (* (select (select (store (let ((.cse6 (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_3378)))) (store (store .cse7 .cse2 v_ArrVal_3380) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:14:44,485 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:14:46,531 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ (select .cse5 .cse7) 1)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int) (v_ArrVal_3373 Int)) (<= (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_3373) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3378)))) (store (store .cse1 .cse2 v_ArrVal_3380) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int) (v_ArrVal_3373 Int)) (<= 0 (+ (* (select (select (store (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_3373) .cse7 .cse8)) |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_3378)))) (store (store .cse10 .cse2 v_ArrVal_3380) .cse3 (+ (select .cse10 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:14:46,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:46,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 403 treesize of output 407 [2022-11-18 20:15:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-18 20:15:09,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880950802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:15:09,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:15:09,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 38 [2022-11-18 20:15:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528454135] [2022-11-18 20:15:09,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:15:09,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 20:15:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 20:15:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=917, Unknown=28, NotChecked=414, Total=1560 [2022-11-18 20:15:09,972 INFO L87 Difference]: Start difference. First operand 616 states and 1271 transitions. Second operand has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 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-18 20:15:23,383 WARN L837 $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 ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3380) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_55 Int) (v_prenex_53 (Array Int Int)) (v_prenex_52 (Array Int Int)) (v_prenex_51 Int) (v_prenex_54 Int)) (< (+ (* (select (select (store (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_prenex_55) .cse2 .cse3)) |c_~#stored_elements~0.base| v_prenex_53))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)) v_prenex_54)))) (store (store .cse6 .cse7 v_prenex_51) .cse4 (+ (select .cse6 .cse4) 1))))) |c_~#stored_elements~0.base| v_prenex_52) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3380) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int) (v_ArrVal_3373 Int)) (<= 0 (+ (* (select (select (store (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_3373) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse9 |c_~#queue~0.base| (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_3378)))) (store (store .cse10 .cse7 v_ArrVal_3380) .cse4 (+ (select .cse10 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:15:46,903 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 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)) (.cse2 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_3383 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_3383 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4)) .cse2)) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= 0 (+ (* (select (select (store (let ((.cse3 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse6 (select .cse3 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse1) 4)) v_ArrVal_3378)))) (store (store .cse4 .cse5 v_ArrVal_3380) .cse1 (+ (select .cse4 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= (+ (* (select (select (store (let ((.cse7 (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse7 |c_~#queue~0.base| (let ((.cse8 (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_3378)))) (store (store .cse8 .cse5 v_ArrVal_3380) .cse1 (+ (select .cse8 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) .cse2)))) is different from false [2022-11-18 20:15:46,966 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (+ |c_~#queue~0.offset| 1604)) (.cse8 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_3383 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= 0 (+ (* (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (let ((.cse4 (select .cse1 |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse0) 4)) v_ArrVal_3378)))) (store (store .cse2 .cse3 v_ArrVal_3380) .cse0 (+ (select .cse2 .cse0) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3378 Int)) (<= (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3376))) (store .cse5 |c_~#queue~0.base| (let ((.cse6 (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse0) 4)) v_ArrVal_3378)))) (store (store .cse6 .cse3 v_ArrVal_3380) .cse0 (+ (select .cse6 .cse0) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) .cse8)) (forall ((v_ArrVal_3383 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) .cse8)))) is different from false [2022-11-18 20:15:49,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (* (select .cse3 .cse2) 4))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ .cse5 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3378 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_3378))) (store (store .cse0 .cse1 v_ArrVal_3380) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse2) 4)))) (<= (+ .cse5 |c_~#queue~0.offset| 4) .cse6) (forall ((v_ArrVal_3380 Int) (v_ArrVal_3383 (Array Int Int)) (v_ArrVal_3378 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse3 .cse4 v_ArrVal_3378))) (store (store .cse7 .cse1 v_ArrVal_3380) .cse2 (+ (select .cse7 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3383) |c_~#queue~0.base|) .cse2) 4) 4) .cse6)) (<= 0 .cse4))))) is different from false [2022-11-18 20:15:49,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:15:49,337 INFO L93 Difference]: Finished difference Result 624 states and 1287 transitions. [2022-11-18 20:15:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:15:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 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-18 20:15:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:15:49,339 INFO L225 Difference]: With dead ends: 624 [2022-11-18 20:15:49,339 INFO L226 Difference]: Without dead ends: 624 [2022-11-18 20:15:49,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 10 IntricatePredicates, 4 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 86.9s TimeCoverageRelationStatistics Valid=339, Invalid=1531, Unknown=62, NotChecked=930, Total=2862 [2022-11-18 20:15:49,341 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:15:49,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 452 Unchecked, 0.7s Time] [2022-11-18 20:15:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-18 20:15:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2022-11-18 20:15:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 612 states have (on average 2.0947712418300655) internal successors, (1282), 621 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1282 transitions. [2022-11-18 20:15:49,352 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1282 transitions. Word has length 21 [2022-11-18 20:15:49,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:15:49,353 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 1282 transitions. [2022-11-18 20:15:49,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 39 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-18 20:15:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1282 transitions. [2022-11-18 20:15:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:15:49,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:15:49,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:49,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-11-18 20:15:49,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-18 20:15:49,561 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:15:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash 393525912, now seen corresponding path program 10 times [2022-11-18 20:15:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:49,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349444904] [2022-11-18 20:15:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:49,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:51,603 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-18 20:15:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:51,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349444904] [2022-11-18 20:15:51,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349444904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:51,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596152101] [2022-11-18 20:15:51,604 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:15:51,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:51,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:51,605 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:15:51,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a8d65f-f00e-46f0-aeea-ed28efc4a9a1/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-18 20:15:51,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:15:51,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:15:51,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-18 20:15:51,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:15:51,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:51,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:51,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:51,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:15:51,966 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:15:51,967 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-18 20:15:52,022 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:15:52,022 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:15:52,189 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-18 20:15:52,460 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 43 treesize of output 36 [2022-11-18 20:15:52,784 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 62 treesize of output 57 [2022-11-18 20:15:53,332 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 54 treesize of output 47 [2022-11-18 20:15:53,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:53,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-18 20:15:53,749 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 59 treesize of output 52 [2022-11-18 20:15:54,104 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 55 treesize of output 50 [2022-11-18 20:15:54,713 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 63 treesize of output 56 [2022-11-18 20:15:54,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:54,928 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 95 treesize of output 97 [2022-11-18 20:15:55,123 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-18 20:15:55,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:55,245 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_3503 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_3503 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:15:55,270 WARN L837 $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_3503 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_3503 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:15:55,295 WARN L837 $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_3503 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_3503 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:16:00,457 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (and (forall ((v_ArrVal_3495 Int)) (or (forall ((v_ArrVal_3496 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_3495)) |c_~#stored_elements~0.base| v_ArrVal_3496))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| 4)))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| (select .cse0 .cse1))) (not (<= 0 .cse2)) (forall ((v_ArrVal_3498 Int) (v_ArrVal_3499 Int) (v_ArrVal_3503 (Array Int Int))) (<= (+ (* (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 .cse2 v_ArrVal_3498))) (store (store .cse4 .cse5 v_ArrVal_3499) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))) (not (<= v_ArrVal_3495 .cse8)))) (forall ((v_ArrVal_3495 Int)) (or (forall ((v_ArrVal_3496 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_3495)) |c_~#stored_elements~0.base| v_ArrVal_3496))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| 4)))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| (select .cse9 .cse1))) (forall ((v_ArrVal_3498 Int) (v_ArrVal_3499 Int) (v_ArrVal_3503 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 .cse12 v_ArrVal_3498))) (store (store .cse11 .cse5 v_ArrVal_3499) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse12)))))) (not (<= v_ArrVal_3495 .cse8)))))) is different from false [2022-11-18 20:16:00,548 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse6 (+ (select .cse7 .cse8) 1)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3498 Int) (v_ArrVal_3499 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| Int) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3495 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_3495)) |c_~#stored_elements~0.base| v_ArrVal_3496))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| 4)))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| (select .cse0 .cse1))) (<= 0 (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse0 .cse5 v_ArrVal_3498))) (store (store .cse3 .cse4 v_ArrVal_3499) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|)) (< .cse6 v_ArrVal_3495) (not (<= 0 .cse5)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3498 Int) (v_ArrVal_3499 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| Int) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3495 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_3495)) |c_~#stored_elements~0.base| v_ArrVal_3496))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|)) (.cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| 4)))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| (select .cse9 .cse1))) (< .cse6 v_ArrVal_3495) (not (<= 0 .cse10)) (<= (+ (* (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse9 .cse10 v_ArrVal_3498))) (store (store .cse12 .cse4 v_ArrVal_3499) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))) is different from false [2022-11-18 20:16:01,084 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse8 .cse10))) (or (= 400 .cse0) (let ((.cse1 (+ .cse0 1)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3498 Int) (v_ArrVal_3499 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| Int) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3495 Int) (v_ArrVal_3493 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_3493) .cse10 v_ArrVal_3495)) |c_~#stored_elements~0.base| v_ArrVal_3496))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|)) (.cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| 4)))) (or (< .cse1 v_ArrVal_3495) (<= (+ (* 4 (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse6 .cse7 v_ArrVal_3498))) (store (store .cse3 .cse4 v_ArrVal_3499) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| (select .cse6 .cse5))) (not (<= 0 .cse7)))))) (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3498 Int) (v_ArrVal_3499 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| Int) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3495 Int) (v_ArrVal_3493 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_3493) .cse10 v_ArrVal_3495)) |c_~#stored_elements~0.base| v_ArrVal_3496))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|)) (.cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| 4)))) (or (< .cse1 v_ArrVal_3495) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| (select .cse11 .cse5))) (not (<= 0 .cse12)) (<= 0 (+ (* 4 (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse11 .cse12 v_ArrVal_3498))) (store (store .cse14 .cse4 v_ArrVal_3499) .cse5 (+ (select .cse14 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))))))))))) is different from false [2022-11-18 20:16:01,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:16:01,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 323 treesize of output 327 [2022-11-18 20:16:01,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse15 (select .cse7 .cse9))) (or (let ((.cse6 (+ .cse15 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (forall ((v_ArrVal_3496 (Array Int Int)) (v_ArrVal_3498 Int) (v_ArrVal_3499 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| Int) (v_ArrVal_3503 (Array Int Int)) (v_ArrVal_3495 Int) (v_ArrVal_3493 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_3493) .cse9 v_ArrVal_3495)) |c_~#stored_elements~0.base| v_ArrVal_3496))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|)) (.cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| 4)))) (or (< .cse6 v_ArrVal_3495) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1365| (select .cse11 .cse3))) (not (<= 0 .cse12)) (<= 0 (+ (* 4 (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse11 .cse12 v_ArrVal_3498))) (store (store .cse14 .cse2 v_ArrVal_3499) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3503) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|)))))))) (and (forall ((v_prenex_59 Int) (v_prenex_60 (Array Int Int)) (v_prenex_58 Int) (v_prenex_57 Int) (v_prenex_62 Int) (v_prenex_56 (Array Int Int)) (v_prenex_61 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_prenex_62) .cse9 v_prenex_61)) |c_~#stored_elements~0.base| v_prenex_56))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|)) (.cse5 (+ (* v_prenex_59 4) |c_~#queue~0.offset|))) (or (< (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_prenex_57))) (store (store .cse1 .cse2 v_prenex_58) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_60) |c_~#queue~0.base|) .cse3) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609)) (not (<= v_prenex_59 (select .cse4 .cse3))) (< .cse6 v_prenex_61) (not (<= 0 .cse5)))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (and (forall ((v_prenex_62 Int) (v_prenex_56 (Array Int Int)) (v_prenex_61 Int)) (or (< (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_prenex_62) .cse9 v_prenex_61)) |c_~#stored_elements~0.base| v_prenex_56) |c_~#queue~0.base|) .cse3))) 0) (< .cse6 v_prenex_61))) .cse10)) .cse10))) (= 400 .cse15)))) is different from false [2022-11-18 20:16:03,868 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-18 20:16:03,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596152101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:16:03,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:16:03,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 16] total 41 [2022-11-18 20:16:03,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074528974] [2022-11-18 20:16:03,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:16:03,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-18 20:16:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:16:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-18 20:16:03,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1055, Unknown=31, NotChecked=518, Total=1806 [2022-11-18 20:16:03,870 INFO L87 Difference]: Start difference. First operand 622 states and 1282 transitions. Second operand has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 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)