./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.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_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/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_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/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_24403249-dc07-4649-bcb3-a1400e8ae96e/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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- 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:03:13,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:03:13,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:03:13,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:03:13,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:03:13,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:03:13,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:03:13,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:03:13,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:03:13,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:03:13,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:03:13,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:03:13,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:03:13,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:03:13,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:03:13,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:03:13,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:03:13,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:03:13,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:03:13,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:03:13,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:03:13,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:03:13,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:03:13,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:03:13,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:03:13,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:03:13,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:03:13,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:03:13,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:03:13,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:03:13,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:03:13,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:03:13,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:03:13,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:03:13,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:03:13,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:03:13,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:03:13,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:03:13,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:03:13,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:03:13,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:03:13,539 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:03:13,561 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:03:13,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:03:13,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:03:13,563 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:03:13,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:03:13,564 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:03:13,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:03:13,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:03:13,566 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:03:13,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:03:13,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:03:13,567 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:03:13,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:03:13,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:03:13,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:03:13,568 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:03:13,569 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:03:13,569 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:03:13,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:03:13,569 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:03:13,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:03:13,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:03:13,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:03:13,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:03:13,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:03:13,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:13,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:03:13,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:03:13,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:03:13,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:03:13,574 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_24403249-dc07-4649-bcb3-a1400e8ae96e/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_24403249-dc07-4649-bcb3-a1400e8ae96e/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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-18 20:03:13,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:03:13,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:03:13,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:03:13,918 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:03:13,919 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:03:13,921 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-18 20:03:14,003 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/data/d3f0b936f/20898612f45b4aed8d3f1f5ff1667c56/FLAGf1d686f27 [2022-11-18 20:03:14,515 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:03:14,516 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-18 20:03:14,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/data/d3f0b936f/20898612f45b4aed8d3f1f5ff1667c56/FLAGf1d686f27 [2022-11-18 20:03:14,836 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/data/d3f0b936f/20898612f45b4aed8d3f1f5ff1667c56 [2022-11-18 20:03:14,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:03:14,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:03:14,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:14,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:03:14,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:03:14,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:14" (1/1) ... [2022-11-18 20:03:14,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:14, skipping insertion in model container [2022-11-18 20:03:14,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:03:14" (1/1) ... [2022-11-18 20:03:14,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:03:14,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:03:15,471 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_24403249-dc07-4649-bcb3-a1400e8ae96e/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-18 20:03:15,478 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_24403249-dc07-4649-bcb3-a1400e8ae96e/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-18 20:03:15,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:15,499 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:03:15,565 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_24403249-dc07-4649-bcb3-a1400e8ae96e/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-18 20:03:15,568 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_24403249-dc07-4649-bcb3-a1400e8ae96e/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-18 20:03:15,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:03:15,622 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:03:15,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15 WrapperNode [2022-11-18 20:03:15,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:03:15,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:15,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:03:15,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:03:15,631 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:03:15" (1/1) ... [2022-11-18 20:03:15,654 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:03:15" (1/1) ... [2022-11-18 20:03:15,688 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-18 20:03:15,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:03:15,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:03:15,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:03:15,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:03:15,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,730 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:03:15,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:03:15,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:03:15,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:03:15,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (1/1) ... [2022-11-18 20:03:15,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:03:15,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:15,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:03:15,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:03:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-18 20:03:15,829 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-18 20:03:15,830 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-18 20:03:15,830 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-18 20:03:15,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:03:15,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:03:15,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:03:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:03:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 20:03:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:03:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:03:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:03:15,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:03:15,840 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:03:15,994 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:03:15,997 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:03:16,602 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:03:16,613 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:03:16,614 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:03:16,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:16 BoogieIcfgContainer [2022-11-18 20:03:16,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:03:16,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:03:16,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:03:16,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:03:16,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:03:14" (1/3) ... [2022-11-18 20:03:16,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eb57f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:16, skipping insertion in model container [2022-11-18 20:03:16,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:03:15" (2/3) ... [2022-11-18 20:03:16,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eb57f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:03:16, skipping insertion in model container [2022-11-18 20:03:16,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:03:16" (3/3) ... [2022-11-18 20:03:16,664 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-18 20:03:16,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:03:16,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-18 20:03:16,706 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:03:16,902 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:03:16,960 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 20:03:16,985 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-18 20:03:16,993 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-18 20:03:16,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-18 20:03:17,126 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-18 20:03:17,126 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:03:17,144 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:03:17,156 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-18 20:03:42,980 INFO L134 LiptonReduction]: Checked pairs total: 60988 [2022-11-18 20:03:42,981 INFO L136 LiptonReduction]: Total number of compositions: 455 [2022-11-18 20:03:42,991 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-18 20:03:43,261 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:03:43,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:03:43,297 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;@535efb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:03:43,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-18 20:03:43,317 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:03:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 20:03:43,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:43,325 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 20:03:43,326 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:03:43,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-11-18 20:03:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:43,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561612004] [2022-11-18 20:03:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:43,532 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:03:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:43,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561612004] [2022-11-18 20:03:43,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561612004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:43,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:43,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 20:03:43,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307270319] [2022-11-18 20:03:43,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:43,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:03:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:03:43,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:03:43,608 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:03:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:43,848 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-18 20:03:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:03:43,851 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:03:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:43,902 INFO L225 Difference]: With dead ends: 2668 [2022-11-18 20:03:43,903 INFO L226 Difference]: Without dead ends: 2668 [2022-11-18 20:03:43,904 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:03:43,910 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:03:43,917 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:03:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-18 20:03:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-18 20:03:44,126 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:03:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-18 20:03:44,153 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-18 20:03:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:44,153 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-18 20:03:44,154 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:03:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-18 20:03:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:03:44,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:44,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:03:44,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:03:44,158 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:03:44,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:44,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1276633, now seen corresponding path program 1 times [2022-11-18 20:03:44,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:44,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843438048] [2022-11-18 20:03:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:44,547 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:03:44,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:44,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843438048] [2022-11-18 20:03:44,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843438048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:44,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:44,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:03:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556063548] [2022-11-18 20:03:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:44,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:44,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:44,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:44,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:44,552 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:03:44,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:44,705 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-18 20:03:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:44,706 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:03:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:44,725 INFO L225 Difference]: With dead ends: 2618 [2022-11-18 20:03:44,726 INFO L226 Difference]: Without dead ends: 2618 [2022-11-18 20:03:44,726 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:03:44,727 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:03:44,728 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:03:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-18 20:03:44,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-18 20:03:44,811 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:03:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-18 20:03:44,828 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-18 20:03:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:44,829 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-18 20:03:44,829 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:03:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-18 20:03:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:03:44,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:44,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:03:44,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:03:44,830 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:03:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:44,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1276634, now seen corresponding path program 1 times [2022-11-18 20:03:44,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:44,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277163162] [2022-11-18 20:03:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:44,964 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:03:44,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:44,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277163162] [2022-11-18 20:03:44,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277163162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:44,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:44,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:03:44,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845415317] [2022-11-18 20:03:44,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:44,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:44,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:44,968 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:03:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:45,122 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-18 20:03:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:45,123 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:03:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:45,142 INFO L225 Difference]: With dead ends: 2568 [2022-11-18 20:03:45,142 INFO L226 Difference]: Without dead ends: 2568 [2022-11-18 20:03:45,143 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:03:45,144 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:03:45,145 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:03:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-18 20:03:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-18 20:03:45,230 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:03:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-18 20:03:45,246 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-18 20:03:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:45,247 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-18 20:03:45,247 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:03:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-18 20:03:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:03:45,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:45,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:03:45,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:03:45,248 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:03:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:45,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811491, now seen corresponding path program 1 times [2022-11-18 20:03:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:45,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929731357] [2022-11-18 20:03:45,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:45,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:45,585 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:03:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929731357] [2022-11-18 20:03:45,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929731357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:45,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:45,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:03:45,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258444373] [2022-11-18 20:03:45,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:45,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:45,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:45,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:45,589 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:03:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:45,739 INFO L93 Difference]: Finished difference Result 2196 states and 6425 transitions. [2022-11-18 20:03:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:45,740 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:03:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:45,756 INFO L225 Difference]: With dead ends: 2196 [2022-11-18 20:03:45,757 INFO L226 Difference]: Without dead ends: 2196 [2022-11-18 20:03:45,757 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:03:45,758 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:03:45,759 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:03:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2022-11-18 20:03:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2196. [2022-11-18 20:03:45,828 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:03:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 6425 transitions. [2022-11-18 20:03:45,841 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 6425 transitions. Word has length 5 [2022-11-18 20:03:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:45,842 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 6425 transitions. [2022-11-18 20:03:45,842 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:03:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 6425 transitions. [2022-11-18 20:03:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:03:45,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:45,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:03:45,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:03:45,844 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:03:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811492, now seen corresponding path program 1 times [2022-11-18 20:03:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:45,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103011508] [2022-11-18 20:03:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:45,984 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:03:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:45,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103011508] [2022-11-18 20:03:45,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103011508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:45,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:45,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:03:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438662852] [2022-11-18 20:03:45,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:45,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:45,988 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:03:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:46,107 INFO L93 Difference]: Finished difference Result 1930 states and 5670 transitions. [2022-11-18 20:03:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:46,108 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:03:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:46,121 INFO L225 Difference]: With dead ends: 1930 [2022-11-18 20:03:46,121 INFO L226 Difference]: Without dead ends: 1930 [2022-11-18 20:03:46,121 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:03:46,122 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:03:46,123 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:03:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2022-11-18 20:03:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1930. [2022-11-18 20:03:46,181 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:03:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5670 transitions. [2022-11-18 20:03:46,191 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5670 transitions. Word has length 5 [2022-11-18 20:03:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:46,192 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 5670 transitions. [2022-11-18 20:03:46,192 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:03:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5670 transitions. [2022-11-18 20:03:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:03:46,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:46,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:03:46,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:03:46,194 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:03:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1226811565, now seen corresponding path program 1 times [2022-11-18 20:03:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:46,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113694525] [2022-11-18 20:03:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:46,910 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:03:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:46,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113694525] [2022-11-18 20:03:46,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113694525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:46,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:46,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:03:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140272489] [2022-11-18 20:03:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:46,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:46,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:46,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:46,913 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:03:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:47,105 INFO L93 Difference]: Finished difference Result 1936 states and 5683 transitions. [2022-11-18 20:03:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 20:03:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:47,131 INFO L225 Difference]: With dead ends: 1936 [2022-11-18 20:03:47,131 INFO L226 Difference]: Without dead ends: 1936 [2022-11-18 20:03:47,132 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:03:47,133 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:47,133 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.2s Time] [2022-11-18 20:03:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2022-11-18 20:03:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1931. [2022-11-18 20:03:47,199 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:03:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 5673 transitions. [2022-11-18 20:03:47,209 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 5673 transitions. Word has length 5 [2022-11-18 20:03:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:47,210 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 5673 transitions. [2022-11-18 20:03:47,210 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:03:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 5673 transitions. [2022-11-18 20:03:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:03:47,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:47,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:03:47,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:03:47,211 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:03:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1226869626, now seen corresponding path program 1 times [2022-11-18 20:03:47,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:47,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763110300] [2022-11-18 20:03:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,272 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:03:47,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:47,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763110300] [2022-11-18 20:03:47,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763110300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:47,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:47,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:03:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527199521] [2022-11-18 20:03:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:47,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:47,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:47,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:47,275 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:03:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:47,401 INFO L93 Difference]: Finished difference Result 1471 states and 4187 transitions. [2022-11-18 20:03:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:47,402 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:03:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:47,411 INFO L225 Difference]: With dead ends: 1471 [2022-11-18 20:03:47,411 INFO L226 Difference]: Without dead ends: 1471 [2022-11-18 20:03:47,411 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:03:47,412 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:03:47,413 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:03:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2022-11-18 20:03:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2022-11-18 20:03:47,460 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:03:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4187 transitions. [2022-11-18 20:03:47,489 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 4187 transitions. Word has length 5 [2022-11-18 20:03:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:47,489 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 4187 transitions. [2022-11-18 20:03:47,489 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:03:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 4187 transitions. [2022-11-18 20:03:47,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:03:47,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:47,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:03:47,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:03:47,492 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:03:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:47,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1226869625, now seen corresponding path program 1 times [2022-11-18 20:03:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240797791] [2022-11-18 20:03:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:47,593 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:03:47,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:47,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240797791] [2022-11-18 20:03:47,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240797791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:47,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:47,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032539725] [2022-11-18 20:03:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:47,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:03:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:03:47,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:03:47,596 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:03:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:47,705 INFO L93 Difference]: Finished difference Result 1011 states and 2701 transitions. [2022-11-18 20:03:47,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:47,706 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:03:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:47,712 INFO L225 Difference]: With dead ends: 1011 [2022-11-18 20:03:47,712 INFO L226 Difference]: Without dead ends: 1011 [2022-11-18 20:03:47,712 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:03:47,713 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:03:47,714 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:03:47,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-18 20:03:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-11-18 20:03:47,746 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:03:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-18 20:03:47,751 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-18 20:03:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:47,752 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-18 20:03:47,752 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:03:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-18 20:03:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:03:47,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:47,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:03:47,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:03:47,754 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:03:47,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash -623492074, now seen corresponding path program 1 times [2022-11-18 20:03:47,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:47,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844387848] [2022-11-18 20:03:47,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:49,179 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:03:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:49,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844387848] [2022-11-18 20:03:49,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844387848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:49,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:49,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:49,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880592888] [2022-11-18 20:03:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:49,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:03:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:49,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:03:49,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:03:49,182 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:03:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:49,917 INFO L93 Difference]: Finished difference Result 1268 states and 3424 transitions. [2022-11-18 20:03:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:03:49,917 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:03:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:49,937 INFO L225 Difference]: With dead ends: 1268 [2022-11-18 20:03:49,937 INFO L226 Difference]: Without dead ends: 1268 [2022-11-18 20:03:49,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:03:49,939 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:49,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:03:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2022-11-18 20:03:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1088. [2022-11-18 20:03:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1046 states have (on average 2.829827915869981) internal successors, (2960), 1087 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states 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:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 2960 transitions. [2022-11-18 20:03:49,982 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 2960 transitions. Word has length 6 [2022-11-18 20:03:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:49,983 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 2960 transitions. [2022-11-18 20:03:49,983 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:03:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2960 transitions. [2022-11-18 20:03:49,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:03:49,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:49,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:03:49,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:03:49,985 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:03:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -623548494, now seen corresponding path program 1 times [2022-11-18 20:03:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:49,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456185915] [2022-11-18 20:03:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:50,327 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:03:50,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:50,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456185915] [2022-11-18 20:03:50,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456185915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:50,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:50,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425651602] [2022-11-18 20:03:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:50,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:03:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:50,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:03:50,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:03:50,330 INFO L87 Difference]: Start difference. First operand 1088 states and 2960 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:03:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:50,555 INFO L93 Difference]: Finished difference Result 1274 states and 3455 transitions. [2022-11-18 20:03:50,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:03:50,556 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:03:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:50,562 INFO L225 Difference]: With dead ends: 1274 [2022-11-18 20:03:50,562 INFO L226 Difference]: Without dead ends: 1274 [2022-11-18 20:03:50,562 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:03:50,563 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:03:50,563 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:03:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2022-11-18 20:03:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 992. [2022-11-18 20:03:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 964 states have (on average 2.8112033195020745) internal successors, (2710), 991 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2710 transitions. [2022-11-18 20:03:50,600 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2710 transitions. Word has length 6 [2022-11-18 20:03:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:50,600 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 2710 transitions. [2022-11-18 20:03:50,600 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:03:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2710 transitions. [2022-11-18 20:03:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:03:50,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:50,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:50,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:03:50,602 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:03:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:50,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1780105148, now seen corresponding path program 1 times [2022-11-18 20:03:50,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:50,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615881352] [2022-11-18 20:03:50,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:50,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:50,690 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:03:50,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:50,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615881352] [2022-11-18 20:03:50,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615881352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:50,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:50,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:03:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312683671] [2022-11-18 20:03:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:50,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:50,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:50,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:50,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:50,694 INFO L87 Difference]: Start difference. First operand 992 states and 2710 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:03:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:50,806 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-18 20:03:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:50,806 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:03:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:50,808 INFO L225 Difference]: With dead ends: 434 [2022-11-18 20:03:50,808 INFO L226 Difference]: Without dead ends: 426 [2022-11-18 20:03:50,808 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:03:50,809 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:03:50,809 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:03:50,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-18 20:03:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-18 20:03:50,821 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:03:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-18 20:03:50,822 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-18 20:03:50,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:50,823 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-18 20:03:50,823 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:03:50,823 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-18 20:03:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:03:50,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:50,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:50,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:03:50,833 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:03:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1257894729, now seen corresponding path program 1 times [2022-11-18 20:03:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:50,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934674439] [2022-11-18 20:03:50,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:50,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:50,993 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:03:50,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:50,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934674439] [2022-11-18 20:03:50,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934674439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:50,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:50,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:03:50,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120534322] [2022-11-18 20:03:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:50,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:03:50,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:50,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:03:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:03:50,995 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:03:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:51,084 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-18 20:03:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:03:51,084 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:03:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:51,086 INFO L225 Difference]: With dead ends: 380 [2022-11-18 20:03:51,086 INFO L226 Difference]: Without dead ends: 380 [2022-11-18 20:03:51,086 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:03:51,087 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:03:51,087 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:03:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-18 20:03:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-18 20:03:51,097 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:03:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-18 20:03:51,099 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-18 20:03:51,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:51,099 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-18 20:03:51,099 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:03:51,099 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-18 20:03:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:03:51,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:51,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:51,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:03:51,101 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:03:51,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:51,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1257894728, now seen corresponding path program 1 times [2022-11-18 20:03:51,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:51,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080711746] [2022-11-18 20:03:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:51,542 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:03:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:51,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080711746] [2022-11-18 20:03:51,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080711746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:51,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:51,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:03:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103799250] [2022-11-18 20:03:51,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:51,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:03:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:03:51,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:51,545 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:03:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:51,736 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-18 20:03:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:03:51,737 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:03:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:51,738 INFO L225 Difference]: With dead ends: 390 [2022-11-18 20:03:51,738 INFO L226 Difference]: Without dead ends: 390 [2022-11-18 20:03:51,738 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:03:51,739 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:03:51,739 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:03:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-18 20:03:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-18 20:03:51,748 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:03:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-18 20:03:51,750 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-18 20:03:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:51,750 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-18 20:03:51,750 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:03:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-18 20:03:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:03:51,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:51,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:03:51,752 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:03:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1098205855, now seen corresponding path program 1 times [2022-11-18 20:03:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:51,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183036127] [2022-11-18 20:03:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:51,996 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:03:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:51,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183036127] [2022-11-18 20:03:51,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183036127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:51,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:51,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:03:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831787541] [2022-11-18 20:03:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:51,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:03:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:52,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:03:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:03:52,001 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:03:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:52,179 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-18 20:03:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:03:52,180 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:03:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:52,181 INFO L225 Difference]: With dead ends: 475 [2022-11-18 20:03:52,181 INFO L226 Difference]: Without dead ends: 475 [2022-11-18 20:03:52,182 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:03:52,182 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 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:03:52,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 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:03:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-18 20:03:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-18 20:03:52,195 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:03:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-18 20:03:52,197 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-18 20:03:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:52,197 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-18 20:03:52,197 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:03:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-18 20:03:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:03:52,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:52,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:52,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:03:52,199 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:03:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash 315359300, now seen corresponding path program 1 times [2022-11-18 20:03:52,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:52,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141187547] [2022-11-18 20:03:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:52,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:52,942 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:03:52,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:52,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141187547] [2022-11-18 20:03:52,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141187547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:03:52,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:03:52,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:03:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180363198] [2022-11-18 20:03:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:03:52,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:03:52,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:03:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:03:52,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:03:52,945 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:03:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:03:53,370 INFO L93 Difference]: Finished difference Result 490 states and 1112 transitions. [2022-11-18 20:03:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:03:53,371 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:03:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:03:53,372 INFO L225 Difference]: With dead ends: 490 [2022-11-18 20:03:53,373 INFO L226 Difference]: Without dead ends: 490 [2022-11-18 20:03:53,373 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:03:53,373 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:03:53,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:03:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-18 20:03:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 464. [2022-11-18 20:03:53,388 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:03:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1067 transitions. [2022-11-18 20:03:53,389 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1067 transitions. Word has length 13 [2022-11-18 20:03:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:03:53,390 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1067 transitions. [2022-11-18 20:03:53,390 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:03:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1067 transitions. [2022-11-18 20:03:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:03:53,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:03:53,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:03:53,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:03:53,392 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:03:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:03:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1993996946, now seen corresponding path program 1 times [2022-11-18 20:03:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:03:53,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035375706] [2022-11-18 20:03:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:53,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:03:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:54,540 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:54,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:03:54,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035375706] [2022-11-18 20:03:54,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035375706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:03:54,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531281599] [2022-11-18 20:03:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:03:54,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:03:54,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:03:54,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:03:54,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:03:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:03:54,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-18 20:03:54,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:03:54,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:54,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:54,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:54,913 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:03:54,914 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:54,945 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:03:54,945 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:03:55,115 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:55,311 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:55,581 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:55,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:03:55,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-18 20:03:55,735 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:55,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:03:55,781 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_500 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_500 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:03:55,873 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_500 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_500) |c_~#queue~0.base|) .cse1) 4) 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:03:56,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:03:56,020 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:04:07,633 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,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531281599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:04:07,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:04:07,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-18 20:04:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227093842] [2022-11-18 20:04:07,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:07,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:04:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:04:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=427, Unknown=11, NotChecked=90, Total=650 [2022-11-18 20:04:07,636 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:04:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:04:08,730 INFO L93 Difference]: Finished difference Result 466 states and 1072 transitions. [2022-11-18 20:04:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:04:08,731 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:04:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:04:08,732 INFO L225 Difference]: With dead ends: 466 [2022-11-18 20:04:08,732 INFO L226 Difference]: Without dead ends: 466 [2022-11-18 20:04:08,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=174, Invalid=635, Unknown=11, NotChecked=110, Total=930 [2022-11-18 20:04:08,734 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:04:08,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 298 Invalid, 0 Unknown, 328 Unchecked, 0.5s Time] [2022-11-18 20:04:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-18 20:04:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 465. [2022-11-18 20:04:08,750 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:04:08,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1070 transitions. [2022-11-18 20:04:08,752 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1070 transitions. Word has length 13 [2022-11-18 20:04:08,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:04:08,752 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 1070 transitions. [2022-11-18 20:04:08,753 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:04:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1070 transitions. [2022-11-18 20:04:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:04:08,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:04:08,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:04:08,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:04:08,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:04:08,961 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:04:08,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:04:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1143154647, now seen corresponding path program 1 times [2022-11-18 20:04:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:04:08,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093497658] [2022-11-18 20:04:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:04:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:30,499 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:30,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:04:30,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093497658] [2022-11-18 20:04:30,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093497658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:04:30,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209709731] [2022-11-18 20:04:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:04:30,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:04:30,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:04:30,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:04:30,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:04:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:04:30,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-18 20:04:30,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:04:30,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:30,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:30,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:30,754 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:04:30,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-18 20:04:30,793 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:04:30,793 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:30,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-18 20:04:30,971 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:04:31,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:04:31,252 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-18 20:04:31,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-18 20:04:31,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:31,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 20:04:31,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-18 20:04:31,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:04:31,911 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:04:32,026 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:32,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:04:32,226 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_593 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_593) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_593 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_593) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:04:32,247 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_593 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_593) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_593 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_593) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:04:32,267 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_593 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_593) |c_~#queue~0.base|) .cse1))))) (forall ((v_ArrVal_593 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_593) |c_~#queue~0.base|) .cse1)) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:04:32,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:04:32,899 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:04:41,254 WARN L233 SmtUtils]: Spent 6.09s 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:04:51,748 WARN L233 SmtUtils]: Spent 8.08s 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:04:56,602 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:56,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209709731] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:04:56,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:04:56,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 27 [2022-11-18 20:04:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682307785] [2022-11-18 20:04:56,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:04:56,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:04:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:04:56,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:04:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=542, Unknown=9, NotChecked=150, Total=812 [2022-11-18 20:04:56,605 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:05:35,677 WARN L233 SmtUtils]: Spent 12.77s on a formula simplification. DAG size of input: 138 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:07,167 WARN L233 SmtUtils]: Spent 22.66s on a formula simplification. DAG size of input: 185 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:06:14,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:06:15,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:06:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:17,698 INFO L93 Difference]: Finished difference Result 960 states and 2219 transitions. [2022-11-18 20:06:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:06:17,699 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:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:17,702 INFO L225 Difference]: With dead ends: 960 [2022-11-18 20:06:17,703 INFO L226 Difference]: Without dead ends: 960 [2022-11-18 20:06:17,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 89.4s TimeCoverageRelationStatistics Valid=260, Invalid=1074, Unknown=10, NotChecked=216, Total=1560 [2022-11-18 20:06:17,704 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 330 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 905 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:17,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 131 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 652 Invalid, 0 Unknown, 905 Unchecked, 24.5s Time] [2022-11-18 20:06:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-11-18 20:06:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 638. [2022-11-18 20:06:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 628 states have (on average 2.4012738853503186) internal successors, (1508), 637 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states 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:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1508 transitions. [2022-11-18 20:06:17,728 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1508 transitions. Word has length 14 [2022-11-18 20:06:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:17,728 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1508 transitions. [2022-11-18 20:06:17,729 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:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1508 transitions. [2022-11-18 20:06:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:06:17,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:17,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:06:17,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:06:17,938 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:06:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1010142995, now seen corresponding path program 2 times [2022-11-18 20:06:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:17,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342206054] [2022-11-18 20:06:17,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:19,381 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:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:19,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342206054] [2022-11-18 20:06:19,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342206054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:19,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916575624] [2022-11-18 20:06:19,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:06:19,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:19,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:19,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:19,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:06:19,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:06:19,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:06:19,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-18 20:06:19,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:19,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:19,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:19,694 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:06:19,695 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:19,737 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:06:19,737 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:20,008 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:20,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-18 20:06:20,339 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:20,639 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:06:20,770 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:06:20,875 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:20,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:20,886 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:06:25,074 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:25,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916575624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:06:25,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:06:25,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-11-18 20:06:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044144209] [2022-11-18 20:06:25,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:06:25,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:06:25,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:06:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:06:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=448, Unknown=56, NotChecked=0, Total=600 [2022-11-18 20:06:25,077 INFO L87 Difference]: Start difference. First operand 638 states and 1508 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:06:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:06:26,514 INFO L93 Difference]: Finished difference Result 668 states and 1589 transitions. [2022-11-18 20:06:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:06:26,514 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:06:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:06:26,517 INFO L225 Difference]: With dead ends: 668 [2022-11-18 20:06:26,517 INFO L226 Difference]: Without dead ends: 668 [2022-11-18 20:06:26,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=174, Invalid=826, Unknown=56, NotChecked=0, Total=1056 [2022-11-18 20:06:26,518 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:06:26,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 75 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 259 Unchecked, 0.4s Time] [2022-11-18 20:06:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-11-18 20:06:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 660. [2022-11-18 20:06:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 650 states have (on average 2.4107692307692306) internal successors, (1567), 659 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states 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,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1567 transitions. [2022-11-18 20:06:26,539 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1567 transitions. Word has length 14 [2022-11-18 20:06:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:06:26,539 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 1567 transitions. [2022-11-18 20:06:26,540 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:06:26,540 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1567 transitions. [2022-11-18 20:06:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:06:26,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:06:26,541 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,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:06:26,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:06:26,749 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:06:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:06:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1858908543, now seen corresponding path program 3 times [2022-11-18 20:06:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:06:26,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457301273] [2022-11-18 20:06:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:06:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:06:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:06:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:06:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:06:28,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457301273] [2022-11-18 20:06:28,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457301273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:06:28,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224596950] [2022-11-18 20:06:28,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:06:28,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:06:28,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:06:28,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:06:28,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:06:28,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:06:28,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:06:28,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:06:28,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:06:28,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:28,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:06:28,436 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:06:28,436 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:28,473 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:06:28,473 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:28,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 46 treesize of output 39 [2022-11-18 20:06:28,981 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,124 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:06:29,490 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:29,611 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:29,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:06:29,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:06:29,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_786 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_786) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_786 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_786) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:06:29,819 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_786 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_786) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_786 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_786) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:06:30,023 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_783 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_783))) (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_786) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_783 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_783))) (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_786) |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:06:30,052 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_782 Int) (v_ArrVal_783 (Array Int Int)) (v_ArrVal_786 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_782)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_783))) (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_786) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_782 Int) (v_ArrVal_783 (Array Int Int)) (v_ArrVal_786 (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_782)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_783))) (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_786) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:06:30,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:06:30,098 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:06:45,220 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:07:00,873 WARN L233 SmtUtils]: Spent 8.14s 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:07:09,610 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:09,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224596950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:09,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:09,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-18 20:07:09,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001711417] [2022-11-18 20:07:09,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:09,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:07:09,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:09,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:07:09,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=435, Unknown=27, NotChecked=188, Total=756 [2022-11-18 20:07:09,614 INFO L87 Difference]: Start difference. First operand 660 states and 1567 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:07:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:15,867 INFO L93 Difference]: Finished difference Result 743 states and 1763 transitions. [2022-11-18 20:07:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:07:15,868 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:07:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:15,871 INFO L225 Difference]: With dead ends: 743 [2022-11-18 20:07:15,871 INFO L226 Difference]: Without dead ends: 743 [2022-11-18 20:07:15,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=175, Invalid=742, Unknown=29, NotChecked=244, Total=1190 [2022-11-18 20:07:15,873 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 104 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1083 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:15,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 166 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 514 Invalid, 0 Unknown, 1083 Unchecked, 2.2s Time] [2022-11-18 20:07:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-18 20:07:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 680. [2022-11-18 20:07:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 670 states have (on average 2.41044776119403) internal successors, (1615), 679 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1615 transitions. [2022-11-18 20:07:15,916 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1615 transitions. Word has length 14 [2022-11-18 20:07:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:15,917 INFO L495 AbstractCegarLoop]: Abstraction has 680 states and 1615 transitions. [2022-11-18 20:07:15,917 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:07:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1615 transitions. [2022-11-18 20:07:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:07:15,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:15,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:15,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:16,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:16,127 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:07:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:16,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1525846337, now seen corresponding path program 4 times [2022-11-18 20:07:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:16,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982482459] [2022-11-18 20:07:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:07:18,621 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:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:07:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982482459] [2022-11-18 20:07:18,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982482459] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:07:18,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410026615] [2022-11-18 20:07:18,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:07:18,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:18,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:07:18,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:07:18,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:07:18,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:07:18,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:07:18,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-18 20:07:18,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:07:18,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:18,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:18,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:19,012 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:07:19,012 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:19,136 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:07:19,136 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:19,664 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:20,283 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:20,770 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:07:21,345 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:21,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:07:21,573 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:21,732 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:21,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:07:21,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_883 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_883) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_883 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_883) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-18 20:07:22,514 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880))) (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_883) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880))) (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_883) |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:07:22,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_879 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_879)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880))) (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_883) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_879 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_879)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_880))) (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_883) |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:07:22,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:07:22,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 159 treesize of output 163 [2022-11-18 20:07:49,368 WARN L233 SmtUtils]: Spent 7.53s 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:07:53,696 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:53,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410026615] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:07:53,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:07:53,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-18 20:07:53,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96165221] [2022-11-18 20:07:53,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:07:53,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:07:53,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:07:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:07:53,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=476, Unknown=25, NotChecked=144, Total=756 [2022-11-18 20:07:53,699 INFO L87 Difference]: Start difference. First operand 680 states and 1615 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:07:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:07:59,137 INFO L93 Difference]: Finished difference Result 884 states and 2099 transitions. [2022-11-18 20:07:59,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:07:59,138 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:07:59,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:07:59,141 INFO L225 Difference]: With dead ends: 884 [2022-11-18 20:07:59,141 INFO L226 Difference]: Without dead ends: 884 [2022-11-18 20:07:59,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=181, Invalid=798, Unknown=25, NotChecked=186, Total=1190 [2022-11-18 20:07:59,142 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 139 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 840 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:07:59,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 157 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 424 Invalid, 0 Unknown, 840 Unchecked, 2.1s Time] [2022-11-18 20:07:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2022-11-18 20:07:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 691. [2022-11-18 20:07:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 681 states have (on average 2.408223201174743) internal successors, (1640), 690 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states 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:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1640 transitions. [2022-11-18 20:07:59,164 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1640 transitions. Word has length 14 [2022-11-18 20:07:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:07:59,165 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 1640 transitions. [2022-11-18 20:07:59,165 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:07:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1640 transitions. [2022-11-18 20:07:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:07:59,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:07:59,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:07:59,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:07:59,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:07:59,373 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:07:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:07:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1686717737, now seen corresponding path program 5 times [2022-11-18 20:07:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:07:59,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646897815] [2022-11-18 20:07:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:07:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:07:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:01,442 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,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:01,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646897815] [2022-11-18 20:08:01,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646897815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042010552] [2022-11-18 20:08:01,443 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:08:01,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:01,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:01,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:01,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:08:01,676 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:08:01,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:08:01,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:08:01,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:01,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,873 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:08:01,873 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,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:01,924 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:08:02,067 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:08:02,067 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,742 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:03,088 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:03,548 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:04,071 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:04,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:04,301 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:04,507 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:04,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:04,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:04,903 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:04,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:04,955 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:08:05,032 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:08:05,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:08:05,056 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:05,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:08:05,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:05,075 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:08:14,973 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:08:15,196 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:15,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042010552] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:15,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:08:15,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2022-11-18 20:08:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33115296] [2022-11-18 20:08:15,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:15,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:08:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:15,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:08:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=480, Unknown=4, NotChecked=0, Total=600 [2022-11-18 20:08:15,199 INFO L87 Difference]: Start difference. First operand 691 states and 1640 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:08:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:26,835 INFO L93 Difference]: Finished difference Result 782 states and 1844 transitions. [2022-11-18 20:08:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:08:26,836 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:08:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:26,838 INFO L225 Difference]: With dead ends: 782 [2022-11-18 20:08:26,838 INFO L226 Difference]: Without dead ends: 782 [2022-11-18 20:08:26,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=217, Invalid=769, Unknown=6, NotChecked=0, Total=992 [2022-11-18 20:08:26,839 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 219 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 510 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:26,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 122 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 539 Invalid, 0 Unknown, 510 Unchecked, 2.6s Time] [2022-11-18 20:08:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-11-18 20:08:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 691. [2022-11-18 20:08:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 681 states have (on average 2.408223201174743) internal successors, (1640), 690 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states 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:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1640 transitions. [2022-11-18 20:08:26,859 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1640 transitions. Word has length 14 [2022-11-18 20:08:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:26,859 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 1640 transitions. [2022-11-18 20:08:26,859 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:08:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1640 transitions. [2022-11-18 20:08:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:08:26,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:26,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:26,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:08:27,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-18 20:08:27,071 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:08:27,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1684353677, now seen corresponding path program 6 times [2022-11-18 20:08:27,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:27,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940055881] [2022-11-18 20:08:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:29,812 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,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:29,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940055881] [2022-11-18 20:08:29,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940055881] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:08:29,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078109277] [2022-11-18 20:08:29,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-18 20:08:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:08:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:29,814 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:08:29,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:08:30,034 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-18 20:08:30,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:08:30,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:08:30,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:08:30,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:30,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:08:30,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:08:30,186 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:08:30,187 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:08:30,290 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:08:30,291 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,919 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,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-18 20:08:32,097 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:32,354 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,687 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,931 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,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:08:32,946 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:33,141 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1078 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1078) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1078 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1078) |c_~#queue~0.base|) .cse0) 4) 3205)))) is different from false [2022-11-18 20:08:35,530 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1077) |c_~#stored_elements~0.base| v_ArrVal_1078) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1077) |c_~#stored_elements~0.base| v_ArrVal_1078) |c_~#queue~0.base|) .cse1) 4) 3205)))) is different from false [2022-11-18 20:08:51,643 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:51,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078109277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:08:51,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:08:51,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-18 20:08:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492007022] [2022-11-18 20:08:51,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:08:51,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:08:51,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:51,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:08:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=472, Unknown=29, NotChecked=94, Total=702 [2022-11-18 20:08:51,646 INFO L87 Difference]: Start difference. First operand 691 states and 1640 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:00,674 INFO L93 Difference]: Finished difference Result 820 states and 1951 transitions. [2022-11-18 20:09:00,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:09:00,675 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 20:09:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:00,678 INFO L225 Difference]: With dead ends: 820 [2022-11-18 20:09:00,678 INFO L226 Difference]: Without dead ends: 820 [2022-11-18 20:09:00,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=259, Invalid=1273, Unknown=36, NotChecked=154, Total=1722 [2022-11-18 20:09:00,680 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:00,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 153 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 347 Invalid, 0 Unknown, 360 Unchecked, 1.7s Time] [2022-11-18 20:09:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-18 20:09:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 693. [2022-11-18 20:09:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 683 states have (on average 2.4084919472913615) internal successors, (1645), 692 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states 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:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1645 transitions. [2022-11-18 20:09:00,701 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1645 transitions. Word has length 14 [2022-11-18 20:09:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:00,701 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 1645 transitions. [2022-11-18 20:09:00,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1645 transitions. [2022-11-18 20:09:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:09:00,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:00,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:00,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:00,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:00,910 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:09:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1684365767, now seen corresponding path program 7 times [2022-11-18 20:09:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:00,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641408214] [2022-11-18 20:09:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,506 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:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641408214] [2022-11-18 20:09:03,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641408214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743685757] [2022-11-18 20:09:03,508 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-18 20:09:03,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:03,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:03,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:03,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:09:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:09:03,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:03,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:03,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:03,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:03,847 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:09:03,847 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:03,998 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:09:03,999 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:04,652 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:05,276 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:06,121 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:06,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:06,457 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:06,716 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:06,956 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:06,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:07,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:09:07,453 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:09:07,496 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1175) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1176) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:09:10,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:10,424 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:19,811 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:19,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743685757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:19,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:19,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:09:19,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165349757] [2022-11-18 20:09:19,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:19,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:09:19,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:19,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:09:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=519, Unknown=15, NotChecked=150, Total=812 [2022-11-18 20:09:19,820 INFO L87 Difference]: Start difference. First operand 693 states and 1645 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:09:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:24,756 INFO L93 Difference]: Finished difference Result 782 states and 1845 transitions. [2022-11-18 20:09:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:09:24,757 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:09:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:24,759 INFO L225 Difference]: With dead ends: 782 [2022-11-18 20:09:24,759 INFO L226 Difference]: Without dead ends: 782 [2022-11-18 20:09:24,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=218, Invalid=901, Unknown=15, NotChecked=198, Total=1332 [2022-11-18 20:09:24,761 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 133 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:24,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 130 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 455 Invalid, 0 Unknown, 880 Unchecked, 2.2s Time] [2022-11-18 20:09:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-11-18 20:09:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 693. [2022-11-18 20:09:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 683 states have (on average 2.4084919472913615) internal successors, (1645), 692 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states 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:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1645 transitions. [2022-11-18 20:09:24,779 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1645 transitions. Word has length 14 [2022-11-18 20:09:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:24,779 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 1645 transitions. [2022-11-18 20:09:24,780 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:09:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1645 transitions. [2022-11-18 20:09:24,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 20:09:24,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:24,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:24,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:24,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:24,988 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:09:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash 350223819, now seen corresponding path program 8 times [2022-11-18 20:09:24,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:24,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057393132] [2022-11-18 20:09:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:27,436 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:27,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:27,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057393132] [2022-11-18 20:09:27,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057393132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:27,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796266451] [2022-11-18 20:09:27,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:09:27,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:27,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:27,438 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:27,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:09:27,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:09:27,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:09:27,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-18 20:09:27,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:27,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:27,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:27,766 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:09:27,767 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:27,873 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:09:27,874 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:28,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 43 treesize of output 36 [2022-11-18 20:09:28,697 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:09:28,990 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:09:29,563 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:09:29,774 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:09:29,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:09:29,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:29,946 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:30,118 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1273 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse0) 4) 3205)) (forall ((v_ArrVal_1273 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:09:30,166 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1273 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1273 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse1) 4) 3205)))) is different from false [2022-11-18 20:09:30,980 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1270 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (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_1268))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1270) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_1270 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (< (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1268))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1270) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse4) 4) 3205)))) is different from false [2022-11-18 20:09:33,963 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1270 Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1268))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store (store .cse1 .cse2 v_ArrVal_1270) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1270 Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (< (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse5 v_ArrVal_1266)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1268))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store .cse7 .cse2 v_ArrVal_1270) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse3) 4) 3205))))) is different from false [2022-11-18 20:09:34,042 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:34,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796266451] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:34,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:34,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-18 20:09:34,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511923965] [2022-11-18 20:09:34,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:34,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:09:34,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:34,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:09:34,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=400, Unknown=19, NotChecked=180, Total=702 [2022-11-18 20:09:34,044 INFO L87 Difference]: Start difference. First operand 693 states and 1645 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:41,400 INFO L93 Difference]: Finished difference Result 1094 states and 2567 transitions. [2022-11-18 20:09:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:09:41,400 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 20:09:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:41,403 INFO L225 Difference]: With dead ends: 1094 [2022-11-18 20:09:41,404 INFO L226 Difference]: Without dead ends: 1094 [2022-11-18 20:09:41,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=293, Invalid=1336, Unknown=27, NotChecked=324, Total=1980 [2022-11-18 20:09:41,405 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 200 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 940 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:41,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 141 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 412 Invalid, 0 Unknown, 940 Unchecked, 1.9s Time] [2022-11-18 20:09:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-11-18 20:09:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 733. [2022-11-18 20:09:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 723 states have (on average 2.4273858921161824) internal successors, (1755), 732 states have internal predecessors, (1755), 0 states have call successors, (0), 0 states 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:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1755 transitions. [2022-11-18 20:09:41,451 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1755 transitions. Word has length 14 [2022-11-18 20:09:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:41,451 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 1755 transitions. [2022-11-18 20:09:41,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1755 transitions. [2022-11-18 20:09:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:09:41,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:41,453 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:41,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:41,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-18 20:09:41,660 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:09:41,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:41,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1332183909, now seen corresponding path program 1 times [2022-11-18 20:09:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:41,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730831869] [2022-11-18 20:09:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:43,963 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:43,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:43,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730831869] [2022-11-18 20:09:43,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730831869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:43,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486831993] [2022-11-18 20:09:43,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:43,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:43,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:43,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:43,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:09:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:44,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:09:44,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:44,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:44,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:44,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:44,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:44,303 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:09:44,304 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,437 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:09:44,437 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,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-18 20:09:45,585 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,873 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:46,704 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,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:46,951 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:47,161 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:47,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:47,326 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1370 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1370) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1370 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1370) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:09:47,363 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1370 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1370) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1370 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1370) |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:09:47,402 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1370 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1370) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1370 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1370) |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:09:47,507 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1366 Int) (v_ArrVal_1370 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1366) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1370) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1366 Int) (v_ArrVal_1370 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1366) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1370) |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:09:47,567 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1366 Int) (v_ArrVal_1370 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1366) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1370) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1366 Int) (v_ArrVal_1370 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1365))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1366) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1370) |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:09:47,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:47,658 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:10:06,271 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:06,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486831993] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:10:06,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:10:06,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:10:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175327280] [2022-11-18 20:10:06,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:10:06,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:10:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:10:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:10:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=454, Unknown=12, NotChecked=240, Total=812 [2022-11-18 20:10:06,273 INFO L87 Difference]: Start difference. First operand 733 states and 1755 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:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:10:11,127 INFO L93 Difference]: Finished difference Result 896 states and 2129 transitions. [2022-11-18 20:10:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:10:11,128 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:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:10:11,130 INFO L225 Difference]: With dead ends: 896 [2022-11-18 20:10:11,130 INFO L226 Difference]: Without dead ends: 896 [2022-11-18 20:10:11,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=205, Invalid=925, Unknown=12, NotChecked=340, Total=1482 [2022-11-18 20:10:11,131 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 129 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 939 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:10:11,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 137 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 423 Invalid, 0 Unknown, 939 Unchecked, 2.0s Time] [2022-11-18 20:10:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-11-18 20:10:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 734. [2022-11-18 20:10:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 724 states have (on average 2.4198895027624308) internal successors, (1752), 733 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states 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:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1752 transitions. [2022-11-18 20:10:11,151 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1752 transitions. Word has length 15 [2022-11-18 20:10:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:10:11,152 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1752 transitions. [2022-11-18 20:10:11,152 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:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1752 transitions. [2022-11-18 20:10:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:10:11,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:10:11,153 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:11,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:10:11,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-18 20:10:11,354 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:10:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:10:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1874112121, now seen corresponding path program 2 times [2022-11-18 20:10:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:10:11,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825340048] [2022-11-18 20:10:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:10:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:10:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:10:13,526 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:13,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:10:13,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825340048] [2022-11-18 20:10:13,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825340048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:10:13,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24546587] [2022-11-18 20:10:13,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:10:13,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:10:13,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:10:13,528 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:10:13,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:10:13,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:10:13,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:10:13,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:10:13,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:10:13,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:13,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:13,857 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:10:13,858 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:10:13,954 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:10:13,955 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:14,499 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:15,081 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:15,446 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:10:16,275 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:16,497 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:16,704 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,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:10:16,865 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1468 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1468 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1468) |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:10:16,902 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1468 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1468 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:10:16,939 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1468 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1468 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1468) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:10:17,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1465 (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_1465))) (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_1468) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1465 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1465))) (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_1468) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:10:17,099 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1464 Int) (v_ArrVal_1465 (Array Int Int))) (<= (+ (* 4 (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1464)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1465))) (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_1468) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1464 Int) (v_ArrVal_1465 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1464)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1465))) (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_1468) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:10:17,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:17,183 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:10:38,011 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:38,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24546587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:10:38,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:10:38,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:10:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6210524] [2022-11-18 20:10:38,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:10:38,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:10:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:10:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:10:38,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=450, Unknown=12, NotChecked=240, Total=812 [2022-11-18 20:10:38,013 INFO L87 Difference]: Start difference. First operand 734 states and 1752 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:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:10:41,957 INFO L93 Difference]: Finished difference Result 843 states and 2008 transitions. [2022-11-18 20:10:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:10:41,958 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:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:10:41,959 INFO L225 Difference]: With dead ends: 843 [2022-11-18 20:10:41,960 INFO L226 Difference]: Without dead ends: 843 [2022-11-18 20:10:41,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=156, Invalid=664, Unknown=12, NotChecked=290, Total=1122 [2022-11-18 20:10:41,960 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 142 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1296 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:10:41,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 156 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 430 Invalid, 0 Unknown, 1296 Unchecked, 2.1s Time] [2022-11-18 20:10:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-11-18 20:10:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 732. [2022-11-18 20:10:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 722 states have (on average 2.4210526315789473) internal successors, (1748), 731 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states 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:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1748 transitions. [2022-11-18 20:10:41,988 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1748 transitions. Word has length 15 [2022-11-18 20:10:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:10:41,989 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1748 transitions. [2022-11-18 20:10:41,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:10:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1748 transitions. [2022-11-18 20:10:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:10:41,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:10:41,996 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:42,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:10:42,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-18 20:10:42,203 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:10:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:10:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash -675367111, now seen corresponding path program 3 times [2022-11-18 20:10:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:10:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642621680] [2022-11-18 20:10:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:10:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:10:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:10:44,436 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:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:10:44,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642621680] [2022-11-18 20:10:44,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642621680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:10:44,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768539549] [2022-11-18 20:10:44,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:10:44,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:10:44,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:10:44,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:10:44,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:10:44,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:10:44,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:10:44,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-18 20:10:44,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:10:44,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:44,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:44,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:44,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:10:44,786 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:10:44,787 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:44,896 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:10:44,896 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:45,449 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:46,042 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:46,854 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:47,122 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:47,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:47,509 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:47,806 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:47,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:10:47,989 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (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|))) (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|))))) is different from false [2022-11-18 20:10:48,027 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1564) |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1564) |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-18 20:10:52,628 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1564) |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)) (v_ArrVal_1564 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1564) |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:10:54,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1561 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1561) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1564) |c_~#stored_elements~0.base| v_ArrVal_1565) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1561 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1561) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1564) |c_~#stored_elements~0.base| v_ArrVal_1565) |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:10:54,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:54,746 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:11:03,291 WARN L233 SmtUtils]: Spent 6.16s 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:11:09,071 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:09,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768539549] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:11:09,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:11:09,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:11:09,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079469381] [2022-11-18 20:11:09,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:09,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:11:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:11:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=488, Unknown=12, NotChecked=196, Total=812 [2022-11-18 20:11:09,074 INFO L87 Difference]: Start difference. First operand 732 states and 1748 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:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:13,563 INFO L93 Difference]: Finished difference Result 771 states and 1835 transitions. [2022-11-18 20:11:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:11:13,564 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:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:13,566 INFO L225 Difference]: With dead ends: 771 [2022-11-18 20:11:13,566 INFO L226 Difference]: Without dead ends: 771 [2022-11-18 20:11:13,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=195, Invalid=865, Unknown=12, NotChecked=260, Total=1332 [2022-11-18 20:11:13,567 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 93 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 737 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:13,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 121 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 406 Invalid, 0 Unknown, 737 Unchecked, 1.9s Time] [2022-11-18 20:11:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2022-11-18 20:11:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 733. [2022-11-18 20:11:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 723 states have (on average 2.424619640387275) internal successors, (1753), 732 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states 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:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1753 transitions. [2022-11-18 20:11:13,586 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1753 transitions. Word has length 15 [2022-11-18 20:11:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:13,587 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 1753 transitions. [2022-11-18 20:11:13,587 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:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1753 transitions. [2022-11-18 20:11:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:11:13,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:13,589 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:13,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:13,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-18 20:11:13,799 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:11:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:13,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1063970069, now seen corresponding path program 4 times [2022-11-18 20:11:13,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:13,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812583185] [2022-11-18 20:11:13,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:13,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:15,984 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:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812583185] [2022-11-18 20:11:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812583185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355233617] [2022-11-18 20:11:15,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:11:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:15,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:15,986 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:15,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:11:16,217 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:11:16,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:11:16,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:11:16,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:16,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:16,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:16,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:16,377 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:11:16,378 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:11:16,513 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:11:16,513 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:17,186 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:17,451 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:18,119 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:18,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:11:19,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:19,095 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:19,286 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:19,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:19,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1663 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1663 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:11:19,485 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1663 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1663 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:11:19,524 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1663 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1663 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:11:19,598 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1663 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1660) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1663 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1660) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1663) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:11:19,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:11:19,674 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:31,639 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:31,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355233617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:11:31,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:11:31,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:11:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839397401] [2022-11-18 20:11:31,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:31,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:11:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:31,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:11:31,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=495, Unknown=11, NotChecked=196, Total=812 [2022-11-18 20:11:31,642 INFO L87 Difference]: Start difference. First operand 733 states and 1753 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:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:37,703 INFO L93 Difference]: Finished difference Result 900 states and 2128 transitions. [2022-11-18 20:11:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:11:37,707 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:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:37,709 INFO L225 Difference]: With dead ends: 900 [2022-11-18 20:11:37,709 INFO L226 Difference]: Without dead ends: 900 [2022-11-18 20:11:37,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=228, Invalid=1037, Unknown=11, NotChecked=284, Total=1560 [2022-11-18 20:11:37,710 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 164 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1136 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:37,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 156 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 458 Invalid, 0 Unknown, 1136 Unchecked, 2.3s Time] [2022-11-18 20:11:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-11-18 20:11:37,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 691. [2022-11-18 20:11:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 681 states have (on average 2.3979441997063144) internal successors, (1633), 690 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states 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:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1633 transitions. [2022-11-18 20:11:37,730 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1633 transitions. Word has length 15 [2022-11-18 20:11:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:37,731 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 1633 transitions. [2022-11-18 20:11:37,731 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:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1633 transitions. [2022-11-18 20:11:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:11:37,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:37,733 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:37,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:37,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:37,934 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:11:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 399659443, now seen corresponding path program 5 times [2022-11-18 20:11:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:37,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754491872] [2022-11-18 20:11:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:39,985 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:39,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:39,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754491872] [2022-11-18 20:11:39,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754491872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:39,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691623084] [2022-11-18 20:11:39,986 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:11:39,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:39,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:39,987 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:39,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:11:40,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:11:40,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:11:40,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-18 20:11:40,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:40,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:40,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:40,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:40,359 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:11:40,360 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:11:40,461 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:11:40,461 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:41,034 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:41,345 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:42,030 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:42,847 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:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:43,145 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:43,365 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:43,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:43,521 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1761 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1761 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:11:43,558 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1761 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1761 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1761) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:11:44,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:11:44,598 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:12:04,837 WARN L233 SmtUtils]: Spent 8.10s 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:12:09,991 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:09,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691623084] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:09,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:09,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:12:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3761814] [2022-11-18 20:12:09,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:09,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:12:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:12:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=569, Unknown=19, NotChecked=102, Total=812 [2022-11-18 20:12:09,993 INFO L87 Difference]: Start difference. First operand 691 states and 1633 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:12:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:14,495 INFO L93 Difference]: Finished difference Result 972 states and 2302 transitions. [2022-11-18 20:12:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:12:14,495 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:12:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:14,497 INFO L225 Difference]: With dead ends: 972 [2022-11-18 20:12:14,497 INFO L226 Difference]: Without dead ends: 972 [2022-11-18 20:12:14,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=224, Invalid=1024, Unknown=20, NotChecked=138, Total=1406 [2022-11-18 20:12:14,499 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 107 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:14,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 142 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 503 Unchecked, 1.5s Time] [2022-11-18 20:12:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-11-18 20:12:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 718. [2022-11-18 20:12:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 708 states have (on average 2.396892655367232) internal successors, (1697), 717 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states 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:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1697 transitions. [2022-11-18 20:12:14,519 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1697 transitions. Word has length 15 [2022-11-18 20:12:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:14,519 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 1697 transitions. [2022-11-18 20:12:14,520 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:12:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1697 transitions. [2022-11-18 20:12:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:12:14,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:14,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:14,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:14,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-18 20:12:14,728 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:12:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:14,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2014977094, now seen corresponding path program 1 times [2022-11-18 20:12:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561467899] [2022-11-18 20:12:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:14,825 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:12:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:14,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561467899] [2022-11-18 20:12:14,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561467899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:14,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:14,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:12:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894731072] [2022-11-18 20:12:14,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:14,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:12:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:12:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:12:14,827 INFO L87 Difference]: Start difference. First operand 718 states and 1697 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:12:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:15,380 INFO L93 Difference]: Finished difference Result 730 states and 1705 transitions. [2022-11-18 20:12:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:12:15,381 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:12:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:15,383 INFO L225 Difference]: With dead ends: 730 [2022-11-18 20:12:15,383 INFO L226 Difference]: Without dead ends: 730 [2022-11-18 20:12:15,383 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:12:15,384 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:15,385 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.5s Time] [2022-11-18 20:12:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2022-11-18 20:12:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 704. [2022-11-18 20:12:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 694 states have (on average 2.3919308357348705) internal successors, (1660), 703 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1660 transitions. [2022-11-18 20:12:15,402 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1660 transitions. Word has length 15 [2022-11-18 20:12:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:15,403 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 1660 transitions. [2022-11-18 20:12:15,403 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:12:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1660 transitions. [2022-11-18 20:12:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:12:15,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:15,405 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:15,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-18 20:12:15,405 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:12:15,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash 538453268, now seen corresponding path program 1 times [2022-11-18 20:12:15,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:15,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998217226] [2022-11-18 20:12:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:15,562 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:12:15,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:15,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998217226] [2022-11-18 20:12:15,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998217226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:15,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:15,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:12:15,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924821400] [2022-11-18 20:12:15,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:15,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:12:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:12:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:12:15,564 INFO L87 Difference]: Start difference. First operand 704 states and 1660 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:12:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:16,072 INFO L93 Difference]: Finished difference Result 434 states and 883 transitions. [2022-11-18 20:12:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:12:16,073 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:12:16,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:16,074 INFO L225 Difference]: With dead ends: 434 [2022-11-18 20:12:16,074 INFO L226 Difference]: Without dead ends: 432 [2022-11-18 20:12:16,074 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:12:16,075 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:16,075 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.5s Time] [2022-11-18 20:12:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-18 20:12:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 428. [2022-11-18 20:12:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 418 states have (on average 2.0956937799043063) internal successors, (876), 427 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 876 transitions. [2022-11-18 20:12:16,085 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 876 transitions. Word has length 16 [2022-11-18 20:12:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:16,086 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 876 transitions. [2022-11-18 20:12:16,086 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:12:16,086 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 876 transitions. [2022-11-18 20:12:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:12:16,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:16,087 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:16,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-18 20:12:16,087 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:12:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:16,088 INFO L85 PathProgramCache]: Analyzing trace with hash 538452307, now seen corresponding path program 1 times [2022-11-18 20:12:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:16,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792355256] [2022-11-18 20:12:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:16,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:18,813 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:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:18,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792355256] [2022-11-18 20:12:18,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792355256] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:18,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379261706] [2022-11-18 20:12:18,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:18,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:18,817 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:18,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:12:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:19,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-18 20:12:19,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:19,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:19,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:19,182 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:12:19,182 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:19,278 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:12:19,279 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:19,863 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:20,509 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:21,323 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:12:21,619 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:12:21,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:21,884 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:12:22,203 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:22,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:22,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1935 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1935) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1935) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:12:22,462 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1934) |c_~#stored_elements~0.base| v_ArrVal_1935) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1935 (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_1934) |c_~#stored_elements~0.base| v_ArrVal_1935) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-18 20:12:22,881 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1934) |c_~#stored_elements~0.base| v_ArrVal_1935) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1934) |c_~#stored_elements~0.base| v_ArrVal_1935) |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:12:24,949 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 Int) (v_ArrVal_1935 (Array Int Int))) (<= (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1930) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1934) |c_~#stored_elements~0.base| v_ArrVal_1935) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 Int) (v_ArrVal_1935 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1930) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1934) |c_~#stored_elements~0.base| v_ArrVal_1935) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:12:25,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:25,005 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:12:40,504 WARN L233 SmtUtils]: Spent 6.09s 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:12:47,751 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:47,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379261706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:12:47,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:12:47,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:12:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108974794] [2022-11-18 20:12:47,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:47,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:12:47,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:47,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:12:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=489, Unknown=12, NotChecked=196, Total=812 [2022-11-18 20:12:47,754 INFO L87 Difference]: Start difference. First operand 428 states and 876 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:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:53,499 INFO L93 Difference]: Finished difference Result 465 states and 939 transitions. [2022-11-18 20:12:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:12:53,500 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:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:53,501 INFO L225 Difference]: With dead ends: 465 [2022-11-18 20:12:53,501 INFO L226 Difference]: Without dead ends: 465 [2022-11-18 20:12:53,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=206, Invalid=920, Unknown=12, NotChecked=268, Total=1406 [2022-11-18 20:12:53,502 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 62 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:53,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 63 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 384 Invalid, 0 Unknown, 566 Unchecked, 1.9s Time] [2022-11-18 20:12:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-11-18 20:12:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 425. [2022-11-18 20:12:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 2.091566265060241) internal successors, (868), 424 states have internal predecessors, (868), 0 states have call successors, (0), 0 states 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:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 868 transitions. [2022-11-18 20:12:53,512 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 868 transitions. Word has length 16 [2022-11-18 20:12:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:53,512 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 868 transitions. [2022-11-18 20:12:53,513 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:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 868 transitions. [2022-11-18 20:12:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:12:53,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:53,513 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:53,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:53,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-18 20:12:53,714 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:12:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:53,714 INFO L85 PathProgramCache]: Analyzing trace with hash -371112587, now seen corresponding path program 2 times [2022-11-18 20:12:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:53,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115597132] [2022-11-18 20:12:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:53,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:55,774 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:55,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:55,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115597132] [2022-11-18 20:12:55,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115597132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:55,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184524589] [2022-11-18 20:12:55,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:12:55,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:55,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:55,777 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:55,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:12:56,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:12:56,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:56,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-18 20:12:56,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:56,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:56,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:56,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:12:56,140 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:12:56,141 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:12:56,240 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:12:56,241 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:56,789 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:57,072 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:12:57,770 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:58,602 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:12:58,890 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:12:59,115 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,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:59,273 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2032 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2032) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_2032 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2032) |c_~#queue~0.base|) .cse0) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:12:59,641 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2032 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2032) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2032 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2032) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:12:59,749 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2029 Int) (v_ArrVal_2032 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2029) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2032) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2029 Int) (v_ArrVal_2032 (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_2029) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2032) |c_~#queue~0.base|) .cse4) 4))))))) is different from false [2022-11-18 20:12:59,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:12:59,798 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:12,305 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:13:12,967 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:12,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184524589] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:12,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:12,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-18 20:13:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904925761] [2022-11-18 20:13:12,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:12,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-18 20:13:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-18 20:13:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=539, Unknown=11, NotChecked=150, Total=812 [2022-11-18 20:13:12,970 INFO L87 Difference]: Start difference. First operand 425 states and 868 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:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:16,732 INFO L93 Difference]: Finished difference Result 492 states and 978 transitions. [2022-11-18 20:13:16,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:13:16,733 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:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:16,734 INFO L225 Difference]: With dead ends: 492 [2022-11-18 20:13:16,734 INFO L226 Difference]: Without dead ends: 492 [2022-11-18 20:13:16,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=195, Invalid=862, Unknown=11, NotChecked=192, Total=1260 [2022-11-18 20:13:16,741 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 60 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 581 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:16,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 64 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 309 Invalid, 0 Unknown, 581 Unchecked, 1.5s Time] [2022-11-18 20:13:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-11-18 20:13:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 422. [2022-11-18 20:13:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 412 states have (on average 2.099514563106796) internal successors, (865), 421 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 865 transitions. [2022-11-18 20:13:16,752 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 865 transitions. Word has length 16 [2022-11-18 20:13:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:16,753 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 865 transitions. [2022-11-18 20:13:16,753 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:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 865 transitions. [2022-11-18 20:13:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:13:16,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:16,754 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:16,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-18 20:13:16,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-18 20:13:16,961 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:13:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -498915977, now seen corresponding path program 3 times [2022-11-18 20:13:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:16,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832387173] [2022-11-18 20:13:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:20,066 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,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:20,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832387173] [2022-11-18 20:13:20,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832387173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:20,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997970273] [2022-11-18 20:13:20,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:13:20,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:20,068 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:20,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:13:20,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-18 20:13:20,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:13:20,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-18 20:13:20,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:20,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:20,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:20,458 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:13:20,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-18 20:13:20,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-18 20:13:20,581 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:13:20,581 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:21,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:21,311 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-18 20:13:21,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-18 20:13:21,591 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 25 treesize of output 25 [2022-11-18 20:13:21,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:21,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:21,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-18 20:13:22,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-18 20:13:22,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:13:22,990 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:22,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:23,001 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:13:23,205 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2125 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse0) 4) 3205)) (forall ((v_ArrVal_2125 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:13:23,250 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2125 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse1) 4) 3205)) (forall ((v_ArrVal_2125 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-18 20:13:23,309 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2125 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse1) 4) 3205)) (forall ((v_ArrVal_2125 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:13:23,384 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2121 Int) (v_ArrVal_2125 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2121) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2121 Int) (v_ArrVal_2125 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2121) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2125) |c_~#queue~0.base|) .cse4) 4) 3205))))) is different from false [2022-11-18 20:13:26,425 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:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997970273] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:26,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:26,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-18 20:13:26,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026559192] [2022-11-18 20:13:26,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:26,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:13:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:13:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=425, Unknown=6, NotChecked=180, Total=702 [2022-11-18 20:13:26,427 INFO L87 Difference]: Start difference. First operand 422 states and 865 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:38,565 INFO L93 Difference]: Finished difference Result 704 states and 1429 transitions. [2022-11-18 20:13:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:13:38,566 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:38,567 INFO L225 Difference]: With dead ends: 704 [2022-11-18 20:13:38,567 INFO L226 Difference]: Without dead ends: 704 [2022-11-18 20:13:38,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=219, Invalid=913, Unknown=6, NotChecked=268, Total=1406 [2022-11-18 20:13:38,568 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 206 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 802 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:38,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 88 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 765 Invalid, 0 Unknown, 802 Unchecked, 4.8s Time] [2022-11-18 20:13:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-18 20:13:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 416. [2022-11-18 20:13:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 406 states have (on average 2.105911330049261) internal successors, (855), 415 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 855 transitions. [2022-11-18 20:13:38,577 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 855 transitions. Word has length 16 [2022-11-18 20:13:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:38,577 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 855 transitions. [2022-11-18 20:13:38,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 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,578 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 855 transitions. [2022-11-18 20:13:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:13:38,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:38,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:38,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:38,787 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:13:38,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash -144042823, now seen corresponding path program 1 times [2022-11-18 20:13:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:38,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186176095] [2022-11-18 20:13:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:40,264 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:13:40,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:40,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186176095] [2022-11-18 20:13:40,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186176095] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:40,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185920929] [2022-11-18 20:13:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:40,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:40,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:40,267 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:40,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:13:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:40,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:13:40,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:40,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:40,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:40,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:40,536 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:13:41,418 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:13:41,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:42,086 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:13:42,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185920929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:42,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:42,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2022-11-18 20:13:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112984172] [2022-11-18 20:13:42,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:42,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:13:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:13:42,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:13:42,088 INFO L87 Difference]: Start difference. First operand 416 states and 855 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:13:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:47,118 INFO L93 Difference]: Finished difference Result 962 states and 1947 transitions. [2022-11-18 20:13:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:13:47,119 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:13:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:47,121 INFO L225 Difference]: With dead ends: 962 [2022-11-18 20:13:47,121 INFO L226 Difference]: Without dead ends: 962 [2022-11-18 20:13:47,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:13:47,122 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 521 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:47,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 53 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-18 20:13:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-18 20:13:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 633. [2022-11-18 20:13:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 623 states have (on average 2.0609951845906904) internal successors, (1284), 632 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1284 transitions. [2022-11-18 20:13:47,137 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1284 transitions. Word has length 19 [2022-11-18 20:13:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:47,138 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 1284 transitions. [2022-11-18 20:13:47,138 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:13:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1284 transitions. [2022-11-18 20:13:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 20:13:47,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:47,140 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:13:47,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:47,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-18 20:13:47,347 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-18 20:13:47,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash -678653597, now seen corresponding path program 1 times [2022-11-18 20:13:47,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:47,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114039873] [2022-11-18 20:13:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:51,301 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:13:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:51,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114039873] [2022-11-18 20:13:51,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114039873] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:51,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159600845] [2022-11-18 20:13:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:51,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:51,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:51,303 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:51,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 20:13:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:51,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-18 20:13:51,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:52,830 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:13:53,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:53,068 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:13:53,222 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:13:53,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:53,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2304 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2304 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2304) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:13:53,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:53,431 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:13:53,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:53,473 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:13:53,490 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:13:53,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:53,554 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:13:53,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:13:53,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:53,571 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:13:54,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:13:54,309 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:13:54,794 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:13:54,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159600845] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:13:54,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:13:54,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 23 [2022-11-18 20:13:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235460026] [2022-11-18 20:13:54,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:54,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 20:13:54,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 20:13:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=419, Unknown=1, NotChecked=42, Total=552 [2022-11-18 20:13:54,796 INFO L87 Difference]: Start difference. First operand 633 states and 1284 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:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:03,180 INFO L93 Difference]: Finished difference Result 835 states and 1679 transitions. [2022-11-18 20:14:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:14:03,181 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:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:03,182 INFO L225 Difference]: With dead ends: 835 [2022-11-18 20:14:03,182 INFO L226 Difference]: Without dead ends: 835 [2022-11-18 20:14:03,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=293, Invalid=900, Unknown=1, NotChecked=66, Total=1260 [2022-11-18 20:14:03,183 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 495 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:03,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 49 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 663 Invalid, 0 Unknown, 106 Unchecked, 4.4s Time] [2022-11-18 20:14:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-11-18 20:14:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 669. [2022-11-18 20:14:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 659 states have (on average 2.065250379362671) internal successors, (1361), 668 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states 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:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1361 transitions. [2022-11-18 20:14:03,198 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1361 transitions. Word has length 21 [2022-11-18 20:14:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:03,198 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 1361 transitions. [2022-11-18 20:14:03,198 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:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1361 transitions. [2022-11-18 20:14:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:14:03,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:03,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:14:03,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:03,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-18 20:14:03,406 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:14:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1101303214, now seen corresponding path program 9 times [2022-11-18 20:14:03,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:03,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158390085] [2022-11-18 20:14:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:07,739 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:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158390085] [2022-11-18 20:14:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158390085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:07,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143746066] [2022-11-18 20:14:07,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:14:07,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:07,741 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:07,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-18 20:14:08,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:14:08,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:14:08,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-18 20:14:08,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:08,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:08,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:08,280 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:14:08,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2022-11-18 20:14:08,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:08,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:08,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:08,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:08,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:08,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2022-11-18 20:14:08,618 INFO L321 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2022-11-18 20:14:08,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 30 treesize of output 44 [2022-11-18 20:14:08,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-11-18 20:14:09,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:14:09,757 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-18 20:14:09,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-18 20:14:10,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 18 [2022-11-18 20:14:10,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:10,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 23 treesize of output 22 [2022-11-18 20:14:11,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 31 treesize of output 15 [2022-11-18 20:14:11,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:14:11,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:14:11,730 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:14:11,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 34 [2022-11-18 20:14:12,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:12,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-18 20:14:12,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-18 20:14:13,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-18 20:14:13,347 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:13,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:14,552 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2422 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_2422 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:14:24,312 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:14:24,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* 4 (select .cse4 .cse3)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2416))) (store (store .cse1 .cse2 v_ArrVal_2419) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse5))))))) (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (+ (* 4 (select .cse9 .cse3)) |c_~#queue~0.offset|))) (or (not (<= 0 .cse6)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2416))) (store (store .cse8 .cse2 v_ArrVal_2419) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))))) is different from false [2022-11-18 20:14:24,442 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse0 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2416))) (store (store .cse1 .cse2 v_ArrVal_2419) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse5))))))) (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse8 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= 0 (+ (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2416))) (store (store .cse9 .cse2 v_ArrVal_2419) .cse3 (+ (select .cse9 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)))))))))) is different from false [2022-11-18 20:14:27,097 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2410 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2410))) (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select .cse8 .cse10))) (or (= 800 .cse0) (forall ((v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2411 Int)) (let ((.cse2 (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_2411) .cse10 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse1 (+ |c_~#queue~0.offset| (* (select .cse6 .cse5) 4)))) (or (not (<= 0 .cse1)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= (+ (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse6 .cse1 v_ArrVal_2416))) (store (store .cse3 .cse4 v_ArrVal_2419) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))))))))))) (forall ((v_ArrVal_2410 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2410))) (let ((.cse17 (select .cse16 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse11 (select .cse17 .cse10))) (or (= 800 .cse11) (forall ((v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2411 Int)) (let ((.cse13 (store (store .cse16 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse17 .cse9 v_ArrVal_2411) .cse10 (+ 1 .cse11))) |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse15 .cse5) 4)))) (or (not (<= 0 .cse12)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= 0 (+ (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2416))) (store (store .cse14 .cse4 v_ArrVal_2419) .cse5 (+ (select .cse14 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))))))))))))) is different from false [2022-11-18 20:14:27,340 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2408 Int) (v_ArrVal_2410 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse12 v_ArrVal_2408)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2410))) (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse10 (select .cse7 .cse9))) (or (forall ((v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2411 Int)) (let ((.cse0 (store (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_2411) .cse9 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2416))) (store (store .cse1 .cse2 v_ArrVal_2419) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse5))))))) (= 800 .cse10)))))) (forall ((v_ArrVal_2408 Int) (v_ArrVal_2410 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse12 v_ArrVal_2408)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2410))) (let ((.cse18 (select .cse17 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse19 (select .cse18 .cse9))) (or (forall ((v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2411 Int)) (let ((.cse13 (store (store .cse17 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse18 .cse8 v_ArrVal_2411) .cse9 (+ .cse19 1))) |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (let ((.cse16 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= (+ (* (select (select (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse15 .cse16 v_ArrVal_2416))) (store (store .cse14 .cse2 v_ArrVal_2419) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse16))))))) (= 800 .cse19)))))))) is different from false [2022-11-18 20:14:27,506 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse10 (select .cse9 .cse5)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1320| Int)) (or (forall ((v_ArrVal_2408 Int) (v_ArrVal_2410 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1320| 4)) v_ArrVal_2408)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2410))) (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (select .cse8 .cse5))) (or (= 800 .cse0) (forall ((v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2411 Int)) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_2411) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse1 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse1)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse6 .cse1 v_ArrVal_2416))) (store (store .cse3 .cse4 v_ArrVal_2419) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse5) 4)) (select |c_#length| |c_~#queue~0.base|))))))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1320| .cse10)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1320| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1320| .cse10)) (forall ((v_ArrVal_2408 Int) (v_ArrVal_2410 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1320| 4)) v_ArrVal_2408)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2410))) (let ((.cse16 (select .cse15 |c_~#queue~0.base|))) (let ((.cse17 (select .cse16 .cse5))) (or (forall ((v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2411 Int)) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_2411) .cse5 (+ .cse17 1))) |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse11)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2416))) (store (store .cse13 .cse4 v_ArrVal_2419) .cse5 (+ (select .cse13 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse5) 4))))))))) (= 800 .cse17))))))))))) is different from false [2022-11-18 20:14:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-18 20:14:27,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143746066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:14:27,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:14:27,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 39 [2022-11-18 20:14:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278247194] [2022-11-18 20:14:27,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:27,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-18 20:14:27,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:27,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-18 20:14:27,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=971, Unknown=49, NotChecked=426, Total=1640 [2022-11-18 20:14:27,903 INFO L87 Difference]: Start difference. First operand 669 states and 1361 transitions. Second operand has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:00,595 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 119 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:15:00,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse22 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse21 .cse22 (+ (select .cse21 .cse22) 1)))) (.cse11 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse16 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse21 .cse22 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse1 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse5 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_2416))) (store (store .cse2 .cse3 v_ArrVal_2419) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse4) 4))))))))) (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse8 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2416))) (store (store .cse9 .cse3 v_ArrVal_2419) .cse4 (+ (select .cse9 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse4) 4) 4) .cse11))))))) (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse12 (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (let ((.cse15 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= (+ (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse15 v_ArrVal_2416))) (store (store .cse13 .cse3 v_ArrVal_2419) .cse4 (+ (select .cse13 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse11)) (not (<= 0 .cse15))))))) (forall ((v_ArrVal_2415 (Array Int Int))) (let ((.cse18 (store .cse16 |c_~#stored_elements~0.base| v_ArrVal_2415))) (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (let ((.cse17 (+ (* (select .cse20 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse17)) (forall ((v_ArrVal_2419 Int) (v_ArrVal_2422 (Array Int Int)) (v_ArrVal_2416 Int)) (<= 0 (+ (* (select (select (store (store .cse18 |c_~#queue~0.base| (let ((.cse19 (store .cse20 .cse17 v_ArrVal_2416))) (store (store .cse19 .cse3 v_ArrVal_2419) .cse4 (+ (select .cse19 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2422) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))))))) is different from false [2022-11-18 20:15:07,810 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:15:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:15:09,982 INFO L93 Difference]: Finished difference Result 1038 states and 2065 transitions. [2022-11-18 20:15:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:15:09,983 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 20:15:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:15:09,985 INFO L225 Difference]: With dead ends: 1038 [2022-11-18 20:15:09,985 INFO L226 Difference]: Without dead ends: 1038 [2022-11-18 20:15:09,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 21 SyntacticMatches, 23 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=474, Invalid=2052, Unknown=52, NotChecked=728, Total=3306 [2022-11-18 20:15:09,987 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 328 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1592 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:15:09,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 183 Invalid, 2828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1182 Invalid, 0 Unknown, 1592 Unchecked, 7.6s Time] [2022-11-18 20:15:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-11-18 20:15:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 676. [2022-11-18 20:15:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 666 states have (on average 2.0585585585585586) internal successors, (1371), 675 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states 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:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1371 transitions. [2022-11-18 20:15:10,000 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1371 transitions. Word has length 22 [2022-11-18 20:15:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:15:10,001 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 1371 transitions. [2022-11-18 20:15:10,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1371 transitions. [2022-11-18 20:15:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:15:10,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:15:10,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:10,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:15:10,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-18 20:15:10,210 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:15:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2099971124, now seen corresponding path program 10 times [2022-11-18 20:15:10,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:10,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665470420] [2022-11-18 20:15:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:13,536 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:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:13,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665470420] [2022-11-18 20:15:13,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665470420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:13,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013430753] [2022-11-18 20:15:13,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:15:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:13,539 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:15:13,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-18 20:15:13,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:15:13,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:15:13,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-18 20:15:13,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:15:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:13,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:13,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:13,940 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:15:13,940 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:15:14,044 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-18 20:15:14,044 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:14,658 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:15:15,306 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:15:16,172 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 58 treesize of output 51 [2022-11-18 20:15:16,524 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:15:16,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:16,877 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:15:17,420 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 73 treesize of output 64 [2022-11-18 20:15:18,146 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 96 treesize of output 91 [2022-11-18 20:15:19,413 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 67 treesize of output 60 [2022-11-18 20:15:19,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:19,917 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 103 treesize of output 105 [2022-11-18 20:15:20,368 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:20,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:20,606 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2542 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2542 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2542) |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:15:20,643 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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2542 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2542 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2542) |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:15:20,680 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2542 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2542 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:15:20,750 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2538 Int)) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2538) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2538 Int)) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2538) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-18 20:15:31,682 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:15:31,743 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2535 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2537))) (store (store .cse1 .cse2 v_ArrVal_2538) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse5))))))) (forall ((v_ArrVal_2535 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse8 (select .cse6 |c_~#queue~0.base|))) (let ((.cse9 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (<= (+ (* (select (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse8 .cse9 v_ArrVal_2537))) (store (store .cse7 .cse2 v_ArrVal_2538) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse9))))))))) is different from false [2022-11-18 20:15:32,604 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2533 Int)) (or (not (<= v_ArrVal_2533 .cse0)) (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2533)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2534) |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (forall ((v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2537))) (store (store .cse2 .cse3 v_ArrVal_2538) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse6))))))))) (forall ((v_ArrVal_2533 Int)) (or (not (<= v_ArrVal_2533 .cse0)) (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2533)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2534) |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)))) (or (forall ((v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 v_ArrVal_2537))) (store (store .cse10 .cse3 v_ArrVal_2538) .cse4 (+ (select .cse10 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse12))))))))))) is different from false [2022-11-18 20:15:32,727 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (+ (select .cse7 .cse8) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2533 Int) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2533)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2534) |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 v_ArrVal_2533) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2537))) (store (store .cse2 .cse3 v_ArrVal_2538) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)) (not (<= 0 .cse6))))))) (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2533 Int) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2533)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2534) |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)))) (or (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 v_ArrVal_2537))) (store (store .cse10 .cse3 v_ArrVal_2538) .cse4 (+ (select .cse10 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (< .cse0 v_ArrVal_2533) (not (<= 0 .cse12)))))))))) is different from false [2022-11-18 20:15:32,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (+ (select .cse7 .cse9) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2530 Int) (v_ArrVal_2533 Int) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_2530) .cse9 v_ArrVal_2533)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2534) |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (< .cse0 v_ArrVal_2533) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2537))) (store (store .cse2 .cse3 v_ArrVal_2538) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (not (<= 0 .cse6))))))) (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2530 Int) (v_ArrVal_2533 Int) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2538 Int)) (let ((.cse10 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_2530) .cse9 v_ArrVal_2533)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2534) |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (let ((.cse13 (+ |c_~#queue~0.offset| (* (select .cse12 .cse4) 4)))) (or (<= 0 (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2537))) (store (store .cse11 .cse3 v_ArrVal_2538) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)) (< .cse0 v_ArrVal_2533) (not (<= 0 .cse13)))))))))) is different from false [2022-11-18 20:15:33,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:33,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 447 treesize of output 451 [2022-11-18 20:15:42,326 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (select .cse7 .cse3))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| Int)) (or (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2530 Int) (v_ArrVal_2533 Int) (v_ArrVal_2542 (Array Int Int)) (v_ArrVal_2537 Int) (v_ArrVal_2528 Int) (v_ArrVal_2538 Int)) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| 4) |c_~#queue~0.offset|) v_ArrVal_2528))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_2530) .cse3 v_ArrVal_2533)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2534) |c_~#stored_elements~0.base| v_ArrVal_2535))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|))) (or (< (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2537))) (store (store .cse1 .cse2 v_ArrVal_2538) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2542) |c_~#queue~0.base|) .cse3) 4) 3209) (not (<= 0 .cse5)) (< (+ (select .cse6 .cse3) 1) v_ArrVal_2533))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| .cse8)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| Int)) (or (forall ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_45 Int) (v_prenex_43 (Array Int Int)) (v_prenex_46 Int) (v_prenex_47 (Array Int Int)) (v_prenex_44 (Array Int Int)) (v_ArrVal_2528 Int)) (let ((.cse13 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| 4) |c_~#queue~0.offset|) v_ArrVal_2528))) (let ((.cse9 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse13 .cse2 v_prenex_45) .cse3 v_prenex_46)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_44) |c_~#stored_elements~0.base| v_prenex_43))) (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (let ((.cse12 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)))) (or (<= 0 (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse11 .cse12 v_prenex_48))) (store (store .cse10 .cse2 v_prenex_49) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_47) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|)) (< (+ (select .cse13 .cse3) 1) v_prenex_46) (not (<= 0 .cse12)))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1327| .cse8))))))) is different from false [2022-11-18 20:15:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-18 20:15:42,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013430753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:15:42,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:15:42,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 40 [2022-11-18 20:15:42,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283114238] [2022-11-18 20:15:42,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:15:42,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-18 20:15:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-18 20:15:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=914, Unknown=23, NotChecked=630, Total=1722 [2022-11-18 20:15:42,735 INFO L87 Difference]: Start difference. First operand 676 states and 1371 transitions. Second operand has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:15:56,750 INFO L93 Difference]: Finished difference Result 920 states and 1778 transitions. [2022-11-18 20:15:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-18 20:15:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 20:15:56,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:15:56,752 INFO L225 Difference]: With dead ends: 920 [2022-11-18 20:15:56,752 INFO L226 Difference]: Without dead ends: 920 [2022-11-18 20:15:56,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 17 SyntacticMatches, 18 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 3 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=354, Invalid=2308, Unknown=26, NotChecked=972, Total=3660 [2022-11-18 20:15:56,753 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 80 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1126 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:15:56,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 113 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 366 Invalid, 0 Unknown, 1126 Unchecked, 1.8s Time] [2022-11-18 20:15:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-11-18 20:15:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 698. [2022-11-18 20:15:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 688 states have (on average 2.061046511627907) internal successors, (1418), 697 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:15:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1418 transitions. [2022-11-18 20:15:56,767 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1418 transitions. Word has length 22 [2022-11-18 20:15:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:15:56,767 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 1418 transitions. [2022-11-18 20:15:56,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 41 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:15:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1418 transitions. [2022-11-18 20:15:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:15:56,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:15:56,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 20:15:56,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-18 20:15:56,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-18 20:15:56,970 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:15:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -164359556, now seen corresponding path program 11 times [2022-11-18 20:15:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:56,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550800084] [2022-11-18 20:15:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:16:01,685 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:16:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:16:01,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550800084] [2022-11-18 20:16:01,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550800084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:16:01,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424648094] [2022-11-18 20:16:01,686 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-18 20:16:01,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:16:01,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:16:01,687 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:16:01,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24403249-dc07-4649-bcb3-a1400e8ae96e/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-18 20:16:01,994 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-18 20:16:01,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:16:01,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-18 20:16:02,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:16:02,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:02,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:02,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:16:02,194 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-18 20:16:02,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2022-11-18 20:16:02,259 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:16:02,259 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:16:03,324 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 49 treesize of output 42 [2022-11-18 20:16:03,417 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:16:03,417 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 30 [2022-11-18 20:16:03,894 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 68 treesize of output 63 [2022-11-18 20:16:03,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-18 20:16:05,218 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 67 treesize of output 58 [2022-11-18 20:16:05,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2022-11-18 20:16:05,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:05,625 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 58 treesize of output 58 [2022-11-18 20:16:06,559 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:16:06,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 69 [2022-11-18 20:16:06,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:16:06,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-18 20:16:07,309 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 76 treesize of output 69 [2022-11-18 20:16:07,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 20:16:08,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 100 treesize of output 95 [2022-11-18 20:16:09,268 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 66 treesize of output 59 [2022-11-18 20:16:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:09,702 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 56 treesize of output 58 [2022-11-18 20:16:10,023 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:16:10,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:16:10,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2662 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2662) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_2662 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2662) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-18 20:16:10,870 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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_2662 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2662) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2662 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2662) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-18 20:16:19,281 WARN L233 SmtUtils]: Spent 6.07s 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:16:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-18 20:16:30,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424648094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:16:30,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:16:30,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 44 [2022-11-18 20:16:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126608356] [2022-11-18 20:16:30,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:16:30,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 20:16:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:16:30,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 20:16:30,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1613, Unknown=34, NotChecked=170, Total=2070 [2022-11-18 20:16:30,590 INFO L87 Difference]: Start difference. First operand 698 states and 1418 transitions. Second operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 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)