./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:29:02,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:29:02,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:29:02,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:29:02,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:29:02,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:29:02,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:29:02,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:29:02,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:29:02,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:29:02,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:29:02,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:29:02,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:29:02,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:29:02,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:29:02,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:29:02,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:29:02,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:29:02,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:29:02,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:29:02,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:29:02,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:29:02,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:29:02,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:29:02,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:29:02,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:29:02,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:29:02,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:29:02,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:29:02,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:29:02,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:29:02,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:29:02,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:29:02,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:29:02,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:29:02,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:29:02,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:29:02,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:29:02,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:29:02,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:29:02,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:29:02,927 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 09:29:02,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:29:02,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:29:02,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:29:02,952 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:29:02,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:29:02,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:29:02,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:29:02,953 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:29:02,953 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:29:02,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:29:02,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:29:02,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:29:02,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:29:02,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:29:02,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:29:02,955 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:29:02,955 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:29:02,955 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:29:02,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:29:02,955 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:29:02,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:29:02,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:29:02,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:29:02,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:29:02,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:29:02,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:29:02,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:29:02,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:29:02,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:29:02,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:29:02,957 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_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-20 09:29:03,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:29:03,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:29:03,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:29:03,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:29:03,285 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:29:03,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 09:29:06,427 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:29:06,789 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:29:06,790 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-20 09:29:06,823 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/data/6b23c9652/1811e4ce805c48c580c2e0340068cd72/FLAGb49cbcdb8 [2022-11-20 09:29:06,842 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/data/6b23c9652/1811e4ce805c48c580c2e0340068cd72 [2022-11-20 09:29:06,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:29:06,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:29:06,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:29:06,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:29:06,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:29:06,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:06" (1/1) ... [2022-11-20 09:29:06,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5002b5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:06, skipping insertion in model container [2022-11-20 09:29:06,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:29:06" (1/1) ... [2022-11-20 09:29:06,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:29:06,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:29:07,486 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 09:29:07,496 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 09:29:07,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:29:07,523 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:29:07,611 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-20 09:29:07,615 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-20 09:29:07,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:29:07,676 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:29:07,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07 WrapperNode [2022-11-20 09:29:07,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:29:07,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:29:07,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:29:07,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:29:07,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,762 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-20 09:29:07,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:29:07,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:29:07,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:29:07,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:29:07,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,832 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:29:07,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:29:07,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:29:07,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:29:07,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (1/1) ... [2022-11-20 09:29:07,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:29:07,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:07,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:29:07,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:29:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 09:29:07,947 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 09:29:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 09:29:07,947 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 09:29:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:29:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:29:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:29:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:29:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 09:29:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:29:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:29:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:29:07,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:29:07,953 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:29:08,163 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:29:08,165 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:29:08,592 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:29:08,602 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:29:08,602 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 09:29:08,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:08 BoogieIcfgContainer [2022-11-20 09:29:08,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:29:08,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:29:08,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:29:08,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:29:08,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:29:06" (1/3) ... [2022-11-20 09:29:08,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e511a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:08, skipping insertion in model container [2022-11-20 09:29:08,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:29:07" (2/3) ... [2022-11-20 09:29:08,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e511a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:29:08, skipping insertion in model container [2022-11-20 09:29:08,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:29:08" (3/3) ... [2022-11-20 09:29:08,622 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-20 09:29:08,646 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:29:08,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-20 09:29:08,653 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:29:08,866 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 09:29:08,904 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:29:08,919 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-20 09:29:08,922 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-20 09:29:08,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-20 09:29:09,099 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-20 09:29:09,100 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 09:29:09,115 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 675 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-20 09:29:09,127 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-20 09:29:30,427 INFO L134 LiptonReduction]: Checked pairs total: 59291 [2022-11-20 09:29:30,428 INFO L136 LiptonReduction]: Total number of compositions: 457 [2022-11-20 09:29:30,437 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-20 09:29:30,641 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-20 09:29:30,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:29:30,678 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;@1995701b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:29:30,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-20 09:29:30,696 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-20 09:29:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:29:30,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:30,702 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:29:30,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2022-11-20 09:29:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:30,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223422323] [2022-11-20 09:29:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:30,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223422323] [2022-11-20 09:29:30,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223422323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:30,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:30,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:29:30,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121074885] [2022-11-20 09:29:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:30,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:29:30,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:29:30,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:29:30,876 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-20 09:29:31,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:31,101 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-20 09:29:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:29:31,104 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-20 09:29:31,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:31,144 INFO L225 Difference]: With dead ends: 2668 [2022-11-20 09:29:31,145 INFO L226 Difference]: Without dead ends: 2668 [2022-11-20 09:29:31,146 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-20 09:29:31,150 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:31,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-20 09:29:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-20 09:29:31,328 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-20 09:29:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-20 09:29:31,345 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-20 09:29:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:31,346 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-20 09:29:31,346 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-20 09:29:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-20 09:29:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:29:31,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:31,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:29:31,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:29:31,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:31,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1279544, now seen corresponding path program 1 times [2022-11-20 09:29:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:31,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978038975] [2022-11-20 09:29:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:31,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978038975] [2022-11-20 09:29:31,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978038975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:31,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:31,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997477074] [2022-11-20 09:29:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:31,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:31,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:31,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:31,705 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-20 09:29:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:31,853 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-20 09:29:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:31,854 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-20 09:29:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:31,872 INFO L225 Difference]: With dead ends: 2618 [2022-11-20 09:29:31,872 INFO L226 Difference]: Without dead ends: 2618 [2022-11-20 09:29:31,873 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-20 09:29:31,878 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-20 09:29:31,884 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-20 09:29:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-20 09:29:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-20 09:29:31,966 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-20 09:29:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-20 09:29:31,981 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-20 09:29:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:31,983 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-20 09:29:31,984 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-20 09:29:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-20 09:29:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:29:31,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:31,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:29:31,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:29:31,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:31,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1279543, now seen corresponding path program 1 times [2022-11-20 09:29:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467795439] [2022-11-20 09:29:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:32,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:32,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467795439] [2022-11-20 09:29:32,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467795439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:32,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:32,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389497461] [2022-11-20 09:29:32,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:32,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:32,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:32,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:32,096 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-20 09:29:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:32,219 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-20 09:29:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:32,220 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-20 09:29:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:32,236 INFO L225 Difference]: With dead ends: 2568 [2022-11-20 09:29:32,236 INFO L226 Difference]: Without dead ends: 2568 [2022-11-20 09:29:32,237 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-20 09:29:32,238 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-20 09:29:32,238 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-20 09:29:32,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-20 09:29:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-20 09:29:32,363 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-20 09:29:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-20 09:29:32,376 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-20 09:29:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:32,376 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-20 09:29:32,376 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-20 09:29:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-20 09:29:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 09:29:32,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:32,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 09:29:32,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:29:32,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669010, now seen corresponding path program 1 times [2022-11-20 09:29:32,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:32,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068088978] [2022-11-20 09:29:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:32,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068088978] [2022-11-20 09:29:32,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068088978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:32,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:32,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046036501] [2022-11-20 09:29:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:32,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:32,527 INFO L87 Difference]: Start difference. First operand 2568 states and 7478 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-20 09:29:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:32,668 INFO L93 Difference]: Finished difference Result 1952 states and 5508 transitions. [2022-11-20 09:29:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:32,669 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-20 09:29:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:32,680 INFO L225 Difference]: With dead ends: 1952 [2022-11-20 09:29:32,681 INFO L226 Difference]: Without dead ends: 1952 [2022-11-20 09:29:32,681 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-20 09:29:32,683 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:32,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-11-20 09:29:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2022-11-20 09:29:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1952 states, 1760 states have (on average 3.1295454545454544) internal successors, (5508), 1951 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5508 transitions. [2022-11-20 09:29:32,748 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5508 transitions. Word has length 5 [2022-11-20 09:29:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:32,749 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5508 transitions. [2022-11-20 09:29:32,749 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-20 09:29:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5508 transitions. [2022-11-20 09:29:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 09:29:32,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:32,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 09:29:32,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:29:32,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669011, now seen corresponding path program 1 times [2022-11-20 09:29:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:32,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626835436] [2022-11-20 09:29:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:32,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626835436] [2022-11-20 09:29:32,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626835436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:32,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:32,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:32,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912100420] [2022-11-20 09:29:32,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:32,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:32,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:32,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:32,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:32,913 INFO L87 Difference]: Start difference. First operand 1952 states and 5508 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-20 09:29:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:33,018 INFO L93 Difference]: Finished difference Result 1336 states and 3538 transitions. [2022-11-20 09:29:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:33,020 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-20 09:29:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:33,027 INFO L225 Difference]: With dead ends: 1336 [2022-11-20 09:29:33,027 INFO L226 Difference]: Without dead ends: 1336 [2022-11-20 09:29:33,027 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-20 09:29:33,028 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:33,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-11-20 09:29:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-11-20 09:29:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1240 states have (on average 2.8532258064516127) internal successors, (3538), 1335 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3538 transitions. [2022-11-20 09:29:33,067 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3538 transitions. Word has length 5 [2022-11-20 09:29:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:33,067 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 3538 transitions. [2022-11-20 09:29:33,067 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-20 09:29:33,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3538 transitions. [2022-11-20 09:29:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 09:29:33,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:33,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 09:29:33,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:29:33,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:33,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601986, now seen corresponding path program 1 times [2022-11-20 09:29:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:33,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072355716] [2022-11-20 09:29:33,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:33,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:33,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:33,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072355716] [2022-11-20 09:29:33,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072355716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:33,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:33,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:33,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51459422] [2022-11-20 09:29:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:33,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:33,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:33,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:33,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:33,297 INFO L87 Difference]: Start difference. First operand 1336 states and 3538 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-20 09:29:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:33,398 INFO L93 Difference]: Finished difference Result 1190 states and 3162 transitions. [2022-11-20 09:29:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:33,399 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-20 09:29:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:33,405 INFO L225 Difference]: With dead ends: 1190 [2022-11-20 09:29:33,405 INFO L226 Difference]: Without dead ends: 1190 [2022-11-20 09:29:33,406 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-20 09:29:33,406 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:33,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-11-20 09:29:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-11-20 09:29:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1120 states have (on average 2.8232142857142857) internal successors, (3162), 1189 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3162 transitions. [2022-11-20 09:29:33,442 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3162 transitions. Word has length 5 [2022-11-20 09:29:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:33,442 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3162 transitions. [2022-11-20 09:29:33,442 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-20 09:29:33,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3162 transitions. [2022-11-20 09:29:33,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 09:29:33,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:33,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 09:29:33,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:29:33,443 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601987, now seen corresponding path program 1 times [2022-11-20 09:29:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:33,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531029369] [2022-11-20 09:29:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:33,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531029369] [2022-11-20 09:29:33,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531029369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:33,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:33,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302394443] [2022-11-20 09:29:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:33,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:33,605 INFO L87 Difference]: Start difference. First operand 1190 states and 3162 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-20 09:29:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:33,699 INFO L93 Difference]: Finished difference Result 1010 states and 2698 transitions. [2022-11-20 09:29:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:33,700 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-20 09:29:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:33,705 INFO L225 Difference]: With dead ends: 1010 [2022-11-20 09:29:33,705 INFO L226 Difference]: Without dead ends: 1010 [2022-11-20 09:29:33,706 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-20 09:29:33,706 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:33,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-20 09:29:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2022-11-20 09:29:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 968 states have (on average 2.7871900826446283) internal successors, (2698), 1009 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2698 transitions. [2022-11-20 09:29:33,736 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2698 transitions. Word has length 5 [2022-11-20 09:29:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:33,737 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 2698 transitions. [2022-11-20 09:29:33,737 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-20 09:29:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2698 transitions. [2022-11-20 09:29:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 09:29:33,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:33,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 09:29:33,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:29:33,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:29:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1229602043, now seen corresponding path program 1 times [2022-11-20 09:29:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:33,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091045816] [2022-11-20 09:29:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:34,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091045816] [2022-11-20 09:29:34,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091045816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:34,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:34,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:34,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43617303] [2022-11-20 09:29:34,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:34,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:34,484 INFO L87 Difference]: Start difference. First operand 1010 states and 2698 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-20 09:29:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:34,751 INFO L93 Difference]: Finished difference Result 1016 states and 2711 transitions. [2022-11-20 09:29:34,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:34,752 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-20 09:29:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:34,757 INFO L225 Difference]: With dead ends: 1016 [2022-11-20 09:29:34,758 INFO L226 Difference]: Without dead ends: 1016 [2022-11-20 09:29:34,758 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-20 09:29:34,758 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:34,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:29:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-11-20 09:29:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1011. [2022-11-20 09:29:34,785 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-20 09:29:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-20 09:29:34,789 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-20 09:29:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-20 09:29:34,789 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-20 09:29:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-20 09:29:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 09:29:34,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:34,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 09:29:34,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:29:34,791 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-20 09:29:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash -534759366, now seen corresponding path program 1 times [2022-11-20 09:29:34,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:34,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679629095] [2022-11-20 09:29:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:35,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679629095] [2022-11-20 09:29:35,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679629095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:35,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:35,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113490757] [2022-11-20 09:29:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:35,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:35,312 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-20 09:29:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:35,514 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-11-20 09:29:35,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:35,515 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-20 09:29:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:35,521 INFO L225 Difference]: With dead ends: 1286 [2022-11-20 09:29:35,521 INFO L226 Difference]: Without dead ends: 1286 [2022-11-20 09:29:35,522 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-20 09:29:35,522 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:35,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 12 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-20 09:29:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-11-20 09:29:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1052 states have (on average 2.826045627376426) internal successors, (2973), 1093 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-11-20 09:29:35,557 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-11-20 09:29:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:35,558 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-11-20 09:29:35,558 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-20 09:29:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-11-20 09:29:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 09:29:35,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:35,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 09:29:35,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:29:35,559 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-20 09:29:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -537040297, now seen corresponding path program 1 times [2022-11-20 09:29:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:35,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235297650] [2022-11-20 09:29:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235297650] [2022-11-20 09:29:35,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235297650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:35,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:35,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313242869] [2022-11-20 09:29:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:35,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:35,747 INFO L87 Difference]: Start difference. First operand 1094 states and 2973 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:35,944 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-11-20 09:29:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:35,944 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-20 09:29:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:35,950 INFO L225 Difference]: With dead ends: 1280 [2022-11-20 09:29:35,951 INFO L226 Difference]: Without dead ends: 1280 [2022-11-20 09:29:35,951 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-20 09:29:35,952 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:35,952 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-20 09:29:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-20 09:29:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-11-20 09:29:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 970 states have (on average 2.8072164948453606) internal successors, (2723), 997 states have internal predecessors, (2723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-20 09:29:35,983 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-20 09:29:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:35,984 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-20 09:29:35,984 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-20 09:29:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-20 09:29:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:29:35,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:35,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:35,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:29:35,986 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-20 09:29:35,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:35,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1494000732, now seen corresponding path program 1 times [2022-11-20 09:29:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:35,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478404002] [2022-11-20 09:29:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:35,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:36,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478404002] [2022-11-20 09:29:36,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478404002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:36,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:36,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080737134] [2022-11-20 09:29:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:36,092 INFO L87 Difference]: Start difference. First operand 998 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:36,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:36,196 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-20 09:29:36,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:36,197 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-20 09:29:36,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:36,199 INFO L225 Difference]: With dead ends: 434 [2022-11-20 09:29:36,199 INFO L226 Difference]: Without dead ends: 426 [2022-11-20 09:29:36,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:36,200 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 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.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:36,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:36,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-20 09:29:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-20 09:29:36,213 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-20 09:29:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-20 09:29:36,215 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-20 09:29:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:36,215 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-20 09:29:36,216 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-20 09:29:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-20 09:29:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:29:36,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:36,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:36,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:29:36,218 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-20 09:29:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash 740251664, now seen corresponding path program 1 times [2022-11-20 09:29:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:36,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312939074] [2022-11-20 09:29:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:36,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:36,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312939074] [2022-11-20 09:29:36,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312939074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:36,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:36,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:29:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532252093] [2022-11-20 09:29:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:36,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:29:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:29:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:29:36,344 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-20 09:29:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:36,423 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-20 09:29:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:29:36,424 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-20 09:29:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:36,426 INFO L225 Difference]: With dead ends: 380 [2022-11-20 09:29:36,426 INFO L226 Difference]: Without dead ends: 380 [2022-11-20 09:29:36,427 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-20 09:29:36,427 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-20 09:29:36,428 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-20 09:29:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-20 09:29:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-20 09:29:36,436 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-20 09:29:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-20 09:29:36,438 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-20 09:29:36,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:36,438 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-20 09:29:36,438 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-20 09:29:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-20 09:29:36,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:29:36,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:36,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:36,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:29:36,440 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-20 09:29:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 740251665, now seen corresponding path program 1 times [2022-11-20 09:29:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:36,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109519136] [2022-11-20 09:29:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:36,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109519136] [2022-11-20 09:29:36,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109519136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:36,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:36,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:29:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089829816] [2022-11-20 09:29:36,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:36,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:29:36,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:36,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:29:36,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:29:36,814 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-20 09:29:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:36,960 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-20 09:29:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:29:36,960 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-20 09:29:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:36,962 INFO L225 Difference]: With dead ends: 390 [2022-11-20 09:29:36,962 INFO L226 Difference]: Without dead ends: 390 [2022-11-20 09:29:36,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-20 09:29:36,963 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:36,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 12 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-20 09:29:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-20 09:29:36,972 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-20 09:29:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-20 09:29:36,973 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-20 09:29:36,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:36,973 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-20 09:29:36,974 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-20 09:29:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-20 09:29:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:29:36,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:36,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:36,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:29:36,975 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-20 09:29:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1341499408, now seen corresponding path program 1 times [2022-11-20 09:29:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:36,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043474991] [2022-11-20 09:29:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:37,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:37,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043474991] [2022-11-20 09:29:37,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043474991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:37,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:37,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:29:37,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269241628] [2022-11-20 09:29:37,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:37,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:29:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:37,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:29:37,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:29:37,171 INFO L87 Difference]: Start difference. First operand 384 states and 898 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-20 09:29:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:37,293 INFO L93 Difference]: Finished difference Result 475 states and 1103 transitions. [2022-11-20 09:29:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:29:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-20 09:29:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:37,295 INFO L225 Difference]: With dead ends: 475 [2022-11-20 09:29:37,296 INFO L226 Difference]: Without dead ends: 475 [2022-11-20 09:29:37,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-20 09:29:37,296 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:37,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:29:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-11-20 09:29:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2022-11-20 09:29:37,309 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-20 09:29:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1103 transitions. [2022-11-20 09:29:37,311 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1103 transitions. Word has length 12 [2022-11-20 09:29:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:37,312 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 1103 transitions. [2022-11-20 09:29:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-20 09:29:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1103 transitions. [2022-11-20 09:29:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:29:37,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:37,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:37,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:29:37,314 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-20 09:29:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1363188893, now seen corresponding path program 1 times [2022-11-20 09:29:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:37,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506617870] [2022-11-20 09:29:37,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:37,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:38,135 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-20 09:29:38,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:38,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506617870] [2022-11-20 09:29:38,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506617870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:29:38,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:29:38,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:29:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168872055] [2022-11-20 09:29:38,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:29:38,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:29:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:29:38,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:29:38,139 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-20 09:29:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:38,413 INFO L93 Difference]: Finished difference Result 624 states and 1427 transitions. [2022-11-20 09:29:38,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:29:38,413 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-20 09:29:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:38,415 INFO L225 Difference]: With dead ends: 624 [2022-11-20 09:29:38,416 INFO L226 Difference]: Without dead ends: 624 [2022-11-20 09:29:38,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:29:38,416 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:38,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 22 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:29:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-11-20 09:29:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 519. [2022-11-20 09:29:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 509 states have (on average 2.3634577603143416) internal successors, (1203), 518 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1203 transitions. [2022-11-20 09:29:38,434 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1203 transitions. Word has length 13 [2022-11-20 09:29:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:38,434 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1203 transitions. [2022-11-20 09:29:38,434 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-20 09:29:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1203 transitions. [2022-11-20 09:29:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:29:38,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:38,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:38,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:29:38,436 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-20 09:29:38,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash 949156331, now seen corresponding path program 2 times [2022-11-20 09:29:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:38,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799170056] [2022-11-20 09:29:38,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:39,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-20 09:29:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799170056] [2022-11-20 09:29:39,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799170056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:39,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143159508] [2022-11-20 09:29:39,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:29:39,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:39,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:39,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:29:39,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:29:39,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:29:39,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:29:39,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 09:29:39,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:40,096 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-20 09:29:40,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:40,152 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-20 09:29:40,187 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-20 09:29:40,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:29:40,200 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-20 09:29:40,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:29:40,332 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-20 09:29:40,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:29:40,345 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-20 09:29:40,351 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-20 09:29:40,375 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-20 09:29:40,376 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 24 treesize of output 1 [2022-11-20 09:29:40,498 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-20 09:29:40,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143159508] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:29:40,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:29:40,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-11-20 09:29:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468208711] [2022-11-20 09:29:40,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:29:40,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 09:29:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:40,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 09:29:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2022-11-20 09:29:40,501 INFO L87 Difference]: Start difference. First operand 519 states and 1203 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 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-20 09:29:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:42,036 INFO L93 Difference]: Finished difference Result 799 states and 1828 transitions. [2022-11-20 09:29:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:29:42,037 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 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-20 09:29:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:42,039 INFO L225 Difference]: With dead ends: 799 [2022-11-20 09:29:42,039 INFO L226 Difference]: Without dead ends: 799 [2022-11-20 09:29:42,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=380, Unknown=1, NotChecked=0, Total=506 [2022-11-20 09:29:42,040 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 310 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:42,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 61 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 510 Invalid, 0 Unknown, 47 Unchecked, 0.8s Time] [2022-11-20 09:29:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-20 09:29:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 532. [2022-11-20 09:29:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 522 states have (on average 2.4061302681992336) internal successors, (1256), 531 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:42,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1256 transitions. [2022-11-20 09:29:42,058 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1256 transitions. Word has length 13 [2022-11-20 09:29:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:42,058 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 1256 transitions. [2022-11-20 09:29:42,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 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-20 09:29:42,058 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1256 transitions. [2022-11-20 09:29:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:29:42,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:42,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:42,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:29:42,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:42,266 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-20 09:29:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1625342350, now seen corresponding path program 1 times [2022-11-20 09:29:42,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:42,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491092068] [2022-11-20 09:29:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:42,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:43,663 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-20 09:29:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:43,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491092068] [2022-11-20 09:29:43,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491092068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:43,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158815972] [2022-11-20 09:29:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:43,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:43,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:43,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:29:43,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:29:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:43,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 09:29:43,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:43,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:43,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:43,872 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:29:43,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 28 treesize of output 36 [2022-11-20 09:29:43,884 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:29:43,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:29:44,028 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-20 09:29:44,195 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-20 09:29:44,454 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-20 09:29:44,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:44,541 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-20 09:29:44,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-20 09:29:44,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:29:44,648 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_577 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_577 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:29:44,663 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_577 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_577 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:29:44,793 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_573 Int) (v_ArrVal_577 (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_573) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_573 Int) (v_ArrVal_577 (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_573) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_577) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-20 09:29:44,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:29:44,814 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-20 09:29:51,940 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-20 09:29:51,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158815972] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:29:51,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:29:51,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-20 09:29:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244485230] [2022-11-20 09:29:51,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:29:51,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 09:29:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 09:29:51,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=386, Unknown=13, NotChecked=132, Total=650 [2022-11-20 09:29:51,943 INFO L87 Difference]: Start difference. First operand 532 states and 1256 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-20 09:29:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:52,846 INFO L93 Difference]: Finished difference Result 538 states and 1268 transitions. [2022-11-20 09:29:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:29:52,847 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 09:29:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:52,848 INFO L225 Difference]: With dead ends: 538 [2022-11-20 09:29:52,848 INFO L226 Difference]: Without dead ends: 538 [2022-11-20 09:29:52,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=159, Invalid=542, Unknown=13, NotChecked=156, Total=870 [2022-11-20 09:29:52,849 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:52,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 96 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 358 Invalid, 0 Unknown, 558 Unchecked, 0.5s Time] [2022-11-20 09:29:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-20 09:29:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 532. [2022-11-20 09:29:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 522 states have (on average 2.4061302681992336) internal successors, (1256), 531 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:29:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1256 transitions. [2022-11-20 09:29:52,863 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1256 transitions. Word has length 13 [2022-11-20 09:29:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:52,865 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 1256 transitions. [2022-11-20 09:29:52,865 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-20 09:29:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1256 transitions. [2022-11-20 09:29:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:29:52,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:52,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:52,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:29:53,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 09:29:53,073 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-20 09:29:53,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash 648121009, now seen corresponding path program 1 times [2022-11-20 09:29:53,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:53,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382924472] [2022-11-20 09:29:53,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:53,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:29:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:54,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382924472] [2022-11-20 09:29:54,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382924472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:54,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42843074] [2022-11-20 09:29:54,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:54,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:54,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:54,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:29:54,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:29:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:54,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-20 09:29:54,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:54,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-11-20 09:29:54,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:54,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:54,431 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:29:54,432 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 12 treesize of output 20 [2022-11-20 09:29:54,460 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:29:54,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-20 09:29:54,541 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-20 09:29:54,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:29:54,699 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 09:29:54,699 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-20 09:29:54,844 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-20 09:29:54,982 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-20 09:29:55,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:55,044 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-20 09:29:55,092 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-20 09:29:55,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:29:55,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:29:55,251 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:29:55,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:29:55,420 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-20 09:30:05,209 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| Int) (v_ArrVal_663 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_663))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_665 Int) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_667 Int)) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| 4)) v_ArrVal_665))) (store (store .cse1 .cse2 v_ArrVal_667) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_670) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| (select .cse4 .cse3))))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| Int) (v_ArrVal_663 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_663))) (let ((.cse7 (select .cse5 |c_~#queue~0.base|))) (or (forall ((v_ArrVal_665 Int) (v_prenex_4 Int) (v_prenex_3 (Array Int Int))) (< (* (select (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| 4)) v_ArrVal_665))) (store (store .cse6 .cse2 v_prenex_4) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_prenex_3) |c_~#queue~0.base|) .cse3) 4) 1609)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1477| (select .cse7 .cse3))))))))) is different from false [2022-11-20 09:30:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:05,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42843074] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:30:05,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:30:05,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2022-11-20 09:30:05,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119258012] [2022-11-20 09:30:05,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:30:05,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 09:30:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 09:30:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=475, Unknown=14, NotChecked=144, Total=756 [2022-11-20 09:30:05,245 INFO L87 Difference]: Start difference. First operand 532 states and 1256 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-20 09:30:17,757 WARN L233 SmtUtils]: Spent 8.14s 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-20 09:30:25,037 WARN L233 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 77 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:30:25,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:25,412 INFO L93 Difference]: Finished difference Result 873 states and 2055 transitions. [2022-11-20 09:30:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:30:25,413 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-20 09:30:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:25,416 INFO L225 Difference]: With dead ends: 873 [2022-11-20 09:30:25,416 INFO L226 Difference]: Without dead ends: 873 [2022-11-20 09:30:25,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=254, Invalid=860, Unknown=20, NotChecked=198, Total=1332 [2022-11-20 09:30:25,417 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 202 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 969 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:25,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 105 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 591 Invalid, 0 Unknown, 969 Unchecked, 0.9s Time] [2022-11-20 09:30:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-11-20 09:30:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 667. [2022-11-20 09:30:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 657 states have (on average 2.4307458143074583) internal successors, (1597), 666 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1597 transitions. [2022-11-20 09:30:25,438 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1597 transitions. Word has length 14 [2022-11-20 09:30:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:25,439 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 1597 transitions. [2022-11-20 09:30:25,439 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-20 09:30:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1597 transitions. [2022-11-20 09:30:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:30:25,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:25,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:25,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:25,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 09:30:25,646 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-20 09:30:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:25,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1854701433, now seen corresponding path program 2 times [2022-11-20 09:30:25,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:25,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270854671] [2022-11-20 09:30:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:27,005 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-20 09:30:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:27,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270854671] [2022-11-20 09:30:27,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270854671] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:30:27,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968910407] [2022-11-20 09:30:27,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:30:27,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:30:27,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:27,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:30:27,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:30:27,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:30:27,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:30:27,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:30:27,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:27,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:27,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:27,293 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:30:27,293 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 28 treesize of output 36 [2022-11-20 09:30:27,326 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:30:27,327 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-20 09:30:27,545 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-20 09:30:27,689 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-20 09:30:27,806 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-20 09:30:28,076 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-20 09:30:28,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:28,169 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-20 09:30:28,247 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-20 09:30:28,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:30:28,255 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-20 09:30:28,554 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_767 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) 1605)) (forall ((v_ArrVal_767 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:30:28,762 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_762 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_762))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_763) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_763 Int) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_762 (Array Int Int))) (< (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_762))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_763) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_767) |c_~#queue~0.base|) .cse4) 4) 1605)))) is different from false [2022-11-20 09:30:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:31,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968910407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:30:31,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:30:31,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-20 09:30:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430871672] [2022-11-20 09:30:31,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:30:31,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 09:30:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 09:30:31,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=470, Unknown=32, NotChecked=94, Total=702 [2022-11-20 09:30:31,736 INFO L87 Difference]: Start difference. First operand 667 states and 1597 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-20 09:30:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:36,508 INFO L93 Difference]: Finished difference Result 951 states and 2262 transitions. [2022-11-20 09:30:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 09:30:36,508 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-20 09:30:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:36,512 INFO L225 Difference]: With dead ends: 951 [2022-11-20 09:30:36,512 INFO L226 Difference]: Without dead ends: 951 [2022-11-20 09:30:36,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=303, Invalid=1140, Unknown=47, NotChecked=150, Total=1640 [2022-11-20 09:30:36,515 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 151 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 872 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:36,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 153 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 357 Invalid, 0 Unknown, 872 Unchecked, 0.5s Time] [2022-11-20 09:30:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-11-20 09:30:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 707. [2022-11-20 09:30:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 697 states have (on average 2.428981348637016) internal successors, (1693), 706 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:30:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1693 transitions. [2022-11-20 09:30:36,544 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1693 transitions. Word has length 14 [2022-11-20 09:30:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:36,545 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 1693 transitions. [2022-11-20 09:30:36,545 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-20 09:30:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1693 transitions. [2022-11-20 09:30:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:30:36,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:36,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:36,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:36,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:30:36,761 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-20 09:30:36,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1868378291, now seen corresponding path program 3 times [2022-11-20 09:30:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:36,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869663030] [2022-11-20 09:30:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:30:37,887 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-20 09:30:37,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:30:37,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869663030] [2022-11-20 09:30:37,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869663030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:30:37,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457833039] [2022-11-20 09:30:37,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:30:37,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:30:37,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:37,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:30:37,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:30:38,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 09:30:38,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:30:38,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:30:38,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:30:38,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:38,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:38,135 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:30:38,136 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 28 treesize of output 36 [2022-11-20 09:30:38,169 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:30:38,169 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-20 09:30:38,377 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-20 09:30:38,609 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-20 09:30:38,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 40 treesize of output 42 [2022-11-20 09:30:39,021 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-20 09:30:39,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:39,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 09:30:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:30:39,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:30:39,488 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_864 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_864 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_864) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:30:39,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861))) (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_864) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_861 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861))) (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_864) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2022-11-20 09:30:39,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:30:39,781 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-20 09:30:41,856 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_prenex_6 Int) (v_prenex_5 (Array Int Int)) (v_prenex_7 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_prenex_6)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_7))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_5) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_864 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_861 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_860)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_861))) (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_864) |c_~#queue~0.base|) .cse5) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-11-20 09:31:02,673 WARN L233 SmtUtils]: Spent 6.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-20 09:31:05,586 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-20 09:31:05,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457833039] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:31:05,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:31:05,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:31:05,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999980412] [2022-11-20 09:31:05,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:05,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:31:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:31:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=509, Unknown=33, NotChecked=150, Total=812 [2022-11-20 09:31:05,589 INFO L87 Difference]: Start difference. First operand 707 states and 1693 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-20 09:31:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:08,889 INFO L93 Difference]: Finished difference Result 872 states and 2075 transitions. [2022-11-20 09:31:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:31:08,889 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-20 09:31:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:08,892 INFO L225 Difference]: With dead ends: 872 [2022-11-20 09:31:08,893 INFO L226 Difference]: Without dead ends: 872 [2022-11-20 09:31:08,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=187, Invalid=781, Unknown=36, NotChecked=186, Total=1190 [2022-11-20 09:31:08,894 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:08,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 135 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 504 Invalid, 0 Unknown, 540 Unchecked, 1.4s Time] [2022-11-20 09:31:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2022-11-20 09:31:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 726. [2022-11-20 09:31:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 716 states have (on average 2.4315642458100557) internal successors, (1741), 725 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1741 transitions. [2022-11-20 09:31:08,915 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1741 transitions. Word has length 14 [2022-11-20 09:31:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:08,916 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1741 transitions. [2022-11-20 09:31:08,916 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-20 09:31:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1741 transitions. [2022-11-20 09:31:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:31:08,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:08,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:08,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:09,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:09,124 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-20 09:31:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1342565967, now seen corresponding path program 4 times [2022-11-20 09:31:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:09,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082452807] [2022-11-20 09:31:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:31:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:10,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082452807] [2022-11-20 09:31:10,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082452807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:10,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364859911] [2022-11-20 09:31:10,792 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:31:10,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:10,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:10,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:10,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 09:31:10,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:31:10,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:31:10,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:31:10,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:11,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:11,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:11,062 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:31:11,062 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 28 treesize of output 36 [2022-11-20 09:31:11,136 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:31:11,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-20 09:31:11,529 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-20 09:31:11,912 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-20 09:31:12,180 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-20 09:31:12,560 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-20 09:31:12,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:12,714 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-20 09:31:12,848 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-20 09:31:12,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:12,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_961 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:31:13,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_961 (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_958))) (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_961) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_961 (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_958))) (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_961) |c_~#queue~0.base|) .cse3) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:31:13,418 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_957 Int) (v_ArrVal_961 (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_957)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_958))) (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_961) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_957 Int) (v_ArrVal_961 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_957)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_958))) (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_961) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:31:13,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:31:13,483 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-20 09:31:21,491 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_prenex_8 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_955 Int) (v_prenex_9 Int)) (< (+ (* 4 (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_955) .cse5 v_prenex_9)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_8))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_10) |c_~#queue~0.base|) .cse6)) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_958 (Array Int Int)) (v_ArrVal_957 Int) (v_ArrVal_955 Int) (v_ArrVal_961 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_955) .cse5 v_ArrVal_957)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_958))) (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|) .cse6)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:31:24,158 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-20 09:31:24,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364859911] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:31:24,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:31:24,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-20 09:31:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24974051] [2022-11-20 09:31:24,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:24,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 09:31:24,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:24,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 09:31:24,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=435, Unknown=23, NotChecked=188, Total=756 [2022-11-20 09:31:24,160 INFO L87 Difference]: Start difference. First operand 726 states and 1741 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-20 09:31:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:28,398 INFO L93 Difference]: Finished difference Result 848 states and 2017 transitions. [2022-11-20 09:31:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:31:28,399 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-20 09:31:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:28,402 INFO L225 Difference]: With dead ends: 848 [2022-11-20 09:31:28,402 INFO L226 Difference]: Without dead ends: 848 [2022-11-20 09:31:28,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=151, Invalid=598, Unknown=23, NotChecked=220, Total=992 [2022-11-20 09:31:28,405 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 65 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:28,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 101 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 268 Invalid, 0 Unknown, 467 Unchecked, 0.9s Time] [2022-11-20 09:31:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-11-20 09:31:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 726. [2022-11-20 09:31:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 716 states have (on average 2.4315642458100557) internal successors, (1741), 725 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1741 transitions. [2022-11-20 09:31:28,429 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1741 transitions. Word has length 14 [2022-11-20 09:31:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:28,430 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1741 transitions. [2022-11-20 09:31:28,431 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-20 09:31:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1741 transitions. [2022-11-20 09:31:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:31:28,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:28,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:28,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:28,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:28,638 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-20 09:31:28,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1154017767, now seen corresponding path program 5 times [2022-11-20 09:31:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:28,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135689172] [2022-11-20 09:31:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:28,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:30,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-20 09:31:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:30,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135689172] [2022-11-20 09:31:30,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135689172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:30,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350835985] [2022-11-20 09:31:30,367 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:31:30,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:30,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:30,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:30,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:31:30,566 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:31:30,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:31:30,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 09:31:30,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:30,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:30,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:30,682 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:31:30,682 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 28 treesize of output 36 [2022-11-20 09:31:30,752 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:31:30,752 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-20 09:31:31,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 09:31:31,418 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-20 09:31:31,923 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-20 09:31:32,105 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-20 09:31:32,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:32,266 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-20 09:31:32,394 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-20 09:31:32,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:32,405 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-20 09:31:32,519 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1058 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1058) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1058 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1058) |c_~#queue~0.base|) .cse0) 4) 1605)))) is different from false [2022-11-20 09:31:32,550 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1057) |c_~#stored_elements~0.base| v_ArrVal_1058) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1057) |c_~#stored_elements~0.base| v_ArrVal_1058) |c_~#queue~0.base|) .cse0) 4) 1605)))) is different from false [2022-11-20 09:31:32,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1057) |c_~#stored_elements~0.base| v_ArrVal_1058) |c_~#queue~0.base|) .cse1) 4) 1605)) (forall ((v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1057) |c_~#stored_elements~0.base| v_ArrVal_1058) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:31:38,699 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-20 09:31:38,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350835985] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:31:38,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:31:38,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-20 09:31:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715509001] [2022-11-20 09:31:38,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:38,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 09:31:38,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 09:31:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=435, Unknown=28, NotChecked=138, Total=702 [2022-11-20 09:31:38,702 INFO L87 Difference]: Start difference. First operand 726 states and 1741 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-20 09:31:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:41,445 INFO L93 Difference]: Finished difference Result 747 states and 1800 transitions. [2022-11-20 09:31:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:31:41,446 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-20 09:31:41,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:41,449 INFO L225 Difference]: With dead ends: 747 [2022-11-20 09:31:41,449 INFO L226 Difference]: Without dead ends: 747 [2022-11-20 09:31:41,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=184, Invalid=792, Unknown=28, NotChecked=186, Total=1190 [2022-11-20 09:31:41,451 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:41,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 69 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 261 Unchecked, 1.0s Time] [2022-11-20 09:31:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-11-20 09:31:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 726. [2022-11-20 09:31:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 716 states have (on average 2.4315642458100557) internal successors, (1741), 725 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1741 transitions. [2022-11-20 09:31:41,472 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1741 transitions. Word has length 14 [2022-11-20 09:31:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:41,473 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1741 transitions. [2022-11-20 09:31:41,473 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-20 09:31:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1741 transitions. [2022-11-20 09:31:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:31:41,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:41,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:41,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 09:31:41,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:41,680 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-20 09:31:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1153993587, now seen corresponding path program 6 times [2022-11-20 09:31:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:41,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683003520] [2022-11-20 09:31:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:43,528 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-20 09:31:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:43,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683003520] [2022-11-20 09:31:43,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683003520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:43,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225283787] [2022-11-20 09:31:43,528 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:31:43,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:43,530 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:43,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:31:43,736 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-20 09:31:43,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:31:43,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 09:31:43,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:43,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:43,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:43,832 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:31:43,833 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 28 treesize of output 36 [2022-11-20 09:31:43,900 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:31:43,901 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-20 09:31:44,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 46 treesize of output 39 [2022-11-20 09:31:44,562 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-20 09:31:45,037 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-20 09:31:45,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:45,223 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-20 09:31:45,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 09:31:45,520 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-20 09:31:45,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:45,536 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-20 09:31:45,658 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1155 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_1155 (Array Int Int))) (< (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155) |c_~#queue~0.base|) .cse0)) 1605)))) is different from false [2022-11-20 09:31:45,702 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1154 (Array Int Int))) (< (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155) |c_~#queue~0.base|) .cse0) 4) 1605)) (forall ((v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1154 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1154) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:31:45,739 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1154 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1154) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1154 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1154) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1155) |c_~#queue~0.base|) .cse1) 4) 1605)))) is different from false [2022-11-20 09:31:53,368 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-20 09:31:53,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225283787] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:31:53,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:31:53,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-20 09:31:53,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719871497] [2022-11-20 09:31:53,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:53,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 09:31:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:53,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 09:31:53,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=447, Unknown=16, NotChecked=138, Total=702 [2022-11-20 09:31:53,370 INFO L87 Difference]: Start difference. First operand 726 states and 1741 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-20 09:31:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:56,549 INFO L93 Difference]: Finished difference Result 982 states and 2376 transitions. [2022-11-20 09:31:56,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 09:31:56,550 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-20 09:31:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:56,553 INFO L225 Difference]: With dead ends: 982 [2022-11-20 09:31:56,553 INFO L226 Difference]: Without dead ends: 982 [2022-11-20 09:31:56,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=187, Invalid=865, Unknown=16, NotChecked=192, Total=1260 [2022-11-20 09:31:56,554 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:56,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 156 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 471 Unchecked, 1.2s Time] [2022-11-20 09:31:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-11-20 09:31:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 717. [2022-11-20 09:31:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 707 states have (on average 2.42998585572843) internal successors, (1718), 716 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1718 transitions. [2022-11-20 09:31:56,573 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1718 transitions. Word has length 14 [2022-11-20 09:31:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:56,574 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1718 transitions. [2022-11-20 09:31:56,574 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-20 09:31:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1718 transitions. [2022-11-20 09:31:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:31:56,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:56,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:56,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 09:31:56,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 09:31:56,781 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:31:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash -551375410, now seen corresponding path program 1 times [2022-11-20 09:31:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:56,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891870314] [2022-11-20 09:31:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:31:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:56,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891870314] [2022-11-20 09:31:56,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891870314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:56,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:56,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046672711] [2022-11-20 09:31:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:56,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:56,894 INFO L87 Difference]: Start difference. First operand 717 states and 1718 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-20 09:31:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:57,214 INFO L93 Difference]: Finished difference Result 729 states and 1726 transitions. [2022-11-20 09:31:57,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:57,215 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-20 09:31:57,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:57,217 INFO L225 Difference]: With dead ends: 729 [2022-11-20 09:31:57,217 INFO L226 Difference]: Without dead ends: 729 [2022-11-20 09:31:57,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:57,218 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:57,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:31:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-20 09:31:57,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2022-11-20 09:31:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 693 states have (on average 2.4256854256854257) internal successors, (1681), 702 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1681 transitions. [2022-11-20 09:31:57,235 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1681 transitions. Word has length 15 [2022-11-20 09:31:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:57,236 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1681 transitions. [2022-11-20 09:31:57,236 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-20 09:31:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1681 transitions. [2022-11-20 09:31:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:31:57,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:57,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:57,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 09:31:57,239 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-20 09:31:57,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1661159439, now seen corresponding path program 1 times [2022-11-20 09:31:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:57,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457745953] [2022-11-20 09:31:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:59,086 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-20 09:31:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:59,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457745953] [2022-11-20 09:31:59,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457745953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:59,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473537748] [2022-11-20 09:31:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:59,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:59,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:59,088 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:59,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:31:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:59,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:31:59,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:59,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:59,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:31:59,380 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:31:59,381 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 28 treesize of output 36 [2022-11-20 09:31:59,453 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:31:59,453 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-20 09:31:59,852 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-20 09:32:00,252 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-20 09:32:00,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 09:32:01,017 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-20 09:32:01,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:01,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 09:32:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:32:01,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:01,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1289 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1289 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:32:01,703 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1289 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1289 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:32:01,761 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1285) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1285) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-20 09:32:01,795 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1285) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1285) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:32:01,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:32:01,836 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-20 09:32:01,925 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_prenex_11 Int) (v_prenex_13 (Array Int Int)) (v_prenex_12 (Array Int Int))) (< (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_13))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_prenex_11) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_12) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1285) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:32:11,055 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-20 09:32:11,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473537748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:32:11,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:32:11,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:32:11,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870141694] [2022-11-20 09:32:11,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:32:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:32:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=451, Unknown=16, NotChecked=240, Total=812 [2022-11-20 09:32:11,057 INFO L87 Difference]: Start difference. First operand 703 states and 1681 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-20 09:32:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:14,896 INFO L93 Difference]: Finished difference Result 894 states and 2136 transitions. [2022-11-20 09:32:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:32:14,896 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-20 09:32:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:14,900 INFO L225 Difference]: With dead ends: 894 [2022-11-20 09:32:14,900 INFO L226 Difference]: Without dead ends: 894 [2022-11-20 09:32:14,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 4 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=187, Invalid=808, Unknown=17, NotChecked=320, Total=1332 [2022-11-20 09:32:14,902 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 139 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 938 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:14,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 134 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 480 Invalid, 0 Unknown, 938 Unchecked, 1.5s Time] [2022-11-20 09:32:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-11-20 09:32:14,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 703. [2022-11-20 09:32:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 693 states have (on average 2.4256854256854257) internal successors, (1681), 702 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1681 transitions. [2022-11-20 09:32:14,931 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1681 transitions. Word has length 15 [2022-11-20 09:32:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:14,931 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1681 transitions. [2022-11-20 09:32:14,931 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-20 09:32:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1681 transitions. [2022-11-20 09:32:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:32:14,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:14,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:14,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:15,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 09:32:15,138 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-20 09:32:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1651600899, now seen corresponding path program 2 times [2022-11-20 09:32:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:15,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332587747] [2022-11-20 09:32:15,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:32:16,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:16,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332587747] [2022-11-20 09:32:16,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332587747] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:16,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676483723] [2022-11-20 09:32:16,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:32:16,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:16,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:16,797 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:16,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 09:32:17,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:32:17,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:32:17,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:32:17,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:17,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:17,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:17,091 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:32:17,092 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 28 treesize of output 36 [2022-11-20 09:32:17,152 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:32:17,153 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-20 09:32:17,634 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-20 09:32:18,022 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-20 09:32:18,260 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-20 09:32:18,761 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-20 09:32:18,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:32:18,938 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-20 09:32:19,109 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-20 09:32:19,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:19,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1386 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse0) 4)))) (forall ((v_ArrVal_1386 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:32:19,287 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1386 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1386 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse1) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:32:19,878 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1383 Int) (v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1381 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1381))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1383) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1383 Int) (v_ArrVal_1386 (Array Int Int)) (v_ArrVal_1381 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1381))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1383) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse4) 4)))))) is different from false [2022-11-20 09:32:19,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:32:19,918 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-20 09:32:32,990 WARN L233 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:32:43,861 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-20 09:32:43,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676483723] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:32:43,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:32:43,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:32:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996691872] [2022-11-20 09:32:43,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:43,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:32:43,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:43,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:32:43,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=514, Unknown=31, NotChecked=150, Total=812 [2022-11-20 09:32:43,863 INFO L87 Difference]: Start difference. First operand 703 states and 1681 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-20 09:33:01,118 WARN L233 SmtUtils]: Spent 7.00s on a formula simplification that was a NOOP. DAG size: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:33:01,144 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse4 .cse5))) (let ((.cse0 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse1 1)))) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (or (= .cse0 4) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (<= 0 .cse1) (not (= |c_~#stored_elements~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (<= (+ (* .cse1 4) 1612 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)))) (forall ((v_ArrVal_1386 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset| 4) .cse0)) (forall ((v_ArrVal_1386 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_1386) |c_~#queue~0.base|) .cse3)) |c_~#queue~0.offset|))))))) is different from false [2022-11-20 09:33:03,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:03,309 INFO L93 Difference]: Finished difference Result 848 states and 2054 transitions. [2022-11-20 09:33:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 09:33:03,310 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-20 09:33:03,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:03,313 INFO L225 Difference]: With dead ends: 848 [2022-11-20 09:33:03,313 INFO L226 Difference]: Without dead ends: 848 [2022-11-20 09:33:03,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=227, Invalid=1141, Unknown=54, NotChecked=300, Total=1722 [2022-11-20 09:33:03,314 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:03,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 152 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 554 Unchecked, 0.8s Time] [2022-11-20 09:33:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2022-11-20 09:33:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 695. [2022-11-20 09:33:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 685 states have (on average 2.4262773722627737) internal successors, (1662), 694 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1662 transitions. [2022-11-20 09:33:03,334 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1662 transitions. Word has length 15 [2022-11-20 09:33:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:03,334 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 1662 transitions. [2022-11-20 09:33:03,334 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-20 09:33:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1662 transitions. [2022-11-20 09:33:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:33:03,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:03,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:03,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-20 09:33:03,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 09:33:03,542 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-20 09:33:03,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1580996229, now seen corresponding path program 3 times [2022-11-20 09:33:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:03,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674675534] [2022-11-20 09:33:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:05,147 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-20 09:33:05,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674675534] [2022-11-20 09:33:05,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674675534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710934751] [2022-11-20 09:33:05,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:33:05,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:05,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:05,150 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:05,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 09:33:05,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 09:33:05,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:33:05,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:33:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:05,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:05,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:05,487 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:33:05,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-20 09:33:05,560 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:33:05,561 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-20 09:33:06,004 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-20 09:33:06,515 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-20 09:33:06,726 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-20 09:33:07,217 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-20 09:33:07,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:07,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 09:33:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:07,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:07,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1483 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1483 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse0))))))) is different from false [2022-11-20 09:33:07,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1483 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_1483 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:33:07,669 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1483 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1483 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:33:07,977 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1480 Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1478))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_1480) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1480 Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1478))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_1480) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:33:08,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:33:08,014 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-20 09:33:17,333 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse4 .cse3))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (or (forall ((v_prenex_17 Int) (v_prenex_19 (Array Int Int)) (v_ArrVal_1476 Int) (v_prenex_18 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1476)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_18))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store (store .cse1 .cse2 v_prenex_17) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_19) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| .cse5)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| Int)) (or (forall ((v_ArrVal_1480 Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1476 Int) (v_ArrVal_1483 (Array Int Int))) (< (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| 4) |c_~#queue~0.offset|) v_ArrVal_1476)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1478))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store (store .cse7 .cse2 v_ArrVal_1480) .cse3 (+ (select .cse7 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1483) |c_~#queue~0.base|) .cse3) 4) 1609)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1509| .cse5))))))) is different from false [2022-11-20 09:33:17,444 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-20 09:33:17,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710934751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:33:17,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:33:17,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:33:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312206366] [2022-11-20 09:33:17,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:17,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:33:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:33:17,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=448, Unknown=17, NotChecked=240, Total=812 [2022-11-20 09:33:17,446 INFO L87 Difference]: Start difference. First operand 695 states and 1662 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-20 09:33:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:20,771 INFO L93 Difference]: Finished difference Result 920 states and 2237 transitions. [2022-11-20 09:33:20,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 09:33:20,772 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-20 09:33:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:20,778 INFO L225 Difference]: With dead ends: 920 [2022-11-20 09:33:20,779 INFO L226 Difference]: Without dead ends: 920 [2022-11-20 09:33:20,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 5 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=183, Invalid=812, Unknown=17, NotChecked=320, Total=1332 [2022-11-20 09:33:20,783 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:20,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 169 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 372 Invalid, 0 Unknown, 726 Unchecked, 1.2s Time] [2022-11-20 09:33:20,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-11-20 09:33:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 693. [2022-11-20 09:33:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 683 states have (on average 2.4216691068814056) internal successors, (1654), 692 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1654 transitions. [2022-11-20 09:33:20,804 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1654 transitions. Word has length 15 [2022-11-20 09:33:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:20,805 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 1654 transitions. [2022-11-20 09:33:20,805 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-20 09:33:20,805 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1654 transitions. [2022-11-20 09:33:20,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:33:20,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:20,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:20,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:21,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 09:33:21,013 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-20 09:33:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2004978827, now seen corresponding path program 4 times [2022-11-20 09:33:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:21,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462325619] [2022-11-20 09:33:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:22,559 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-20 09:33:22,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462325619] [2022-11-20 09:33:22,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462325619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670448265] [2022-11-20 09:33:22,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:33:22,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:22,561 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:22,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 09:33:22,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:33:22,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:33:22,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:33:22,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:22,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:22,852 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:33:22,853 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 28 treesize of output 36 [2022-11-20 09:33:22,914 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:33:22,914 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-20 09:33:23,273 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-20 09:33:23,668 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-20 09:33:23,838 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-20 09:33:24,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 09:33:24,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:24,504 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-20 09:33:24,631 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-20 09:33:24,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:24,927 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1580 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1580) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1580 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1580) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:33:24,952 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1580 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1580) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1580 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1580) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:33:25,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1580 (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_1577))) (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_1580) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1580 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1577))) (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_1580) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:33:25,044 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1575 Int) (v_ArrVal_1580 (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_1575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1577))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse1 .cse2 (+ 1 (select .cse1 .cse2)))))) |c_~#stored_elements~0.base| v_ArrVal_1580) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1575 Int) (v_ArrVal_1580 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1577))) (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse7 .cse2 (+ 1 (select .cse7 .cse2)))))) |c_~#stored_elements~0.base| v_ArrVal_1580) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:33:25,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:33:25,089 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-20 09:33:38,697 WARN L233 SmtUtils]: Spent 8.69s 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-20 09:33:42,742 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1577 (Array Int Int)) (v_ArrVal_1574 Int) (v_ArrVal_1575 Int) (v_ArrVal_1580 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1574) .cse5 v_ArrVal_1575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1577))) (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_1580) |c_~#queue~0.base|) .cse6) 4)))) (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_1574 Int) (v_prenex_21 Int) (v_prenex_22 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1574) .cse5 v_prenex_21)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_20))) (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_22) |c_~#queue~0.base|) .cse6))) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))))) is different from false [2022-11-20 09:33:47,943 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-20 09:33:47,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670448265] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:33:47,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:33:47,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:33:47,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711583926] [2022-11-20 09:33:47,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:47,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:33:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:47,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:33:47,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=438, Unknown=15, NotChecked=240, Total=812 [2022-11-20 09:33:47,945 INFO L87 Difference]: Start difference. First operand 693 states and 1654 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-20 09:33:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:57,915 INFO L93 Difference]: Finished difference Result 863 states and 2072 transitions. [2022-11-20 09:33:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:33:57,916 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-20 09:33:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:57,919 INFO L225 Difference]: With dead ends: 863 [2022-11-20 09:33:57,919 INFO L226 Difference]: Without dead ends: 863 [2022-11-20 09:33:57,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=192, Invalid=741, Unknown=17, NotChecked=310, Total=1260 [2022-11-20 09:33:57,921 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 144 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1100 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:57,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 122 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 1100 Unchecked, 1.5s Time] [2022-11-20 09:33:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-11-20 09:33:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 708. [2022-11-20 09:33:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 698 states have (on average 2.4240687679083095) internal successors, (1692), 707 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1692 transitions. [2022-11-20 09:33:57,943 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1692 transitions. Word has length 15 [2022-11-20 09:33:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:57,943 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 1692 transitions. [2022-11-20 09:33:57,943 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-20 09:33:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1692 transitions. [2022-11-20 09:33:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:33:57,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:57,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:57,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-20 09:33:58,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 09:33:58,153 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-20 09:33:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1330138119, now seen corresponding path program 5 times [2022-11-20 09:33:58,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:58,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495859309] [2022-11-20 09:33:58,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:59,974 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-20 09:33:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:59,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495859309] [2022-11-20 09:33:59,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495859309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:59,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514104926] [2022-11-20 09:33:59,975 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:33:59,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:59,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:59,976 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:59,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 09:34:00,191 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:34:00,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:34:00,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-20 09:34:00,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:00,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:00,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:00,305 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:34:00,305 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 28 treesize of output 36 [2022-11-20 09:34:00,406 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:34:00,407 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-20 09:34:00,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 09:34:01,451 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-20 09:34:02,011 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-20 09:34:02,524 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-20 09:34:02,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:02,784 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-20 09:34:03,006 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-20 09:34:03,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:34:03,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1677 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1677) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1677 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1677) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:34:03,172 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1677 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1677) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1677 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1677) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:34:03,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1677 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1677) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1677 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1677) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-20 09:34:03,236 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1674 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1674))) (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_1677) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1674 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1674))) (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_1677) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2022-11-20 09:34:04,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:34:04,090 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-20 09:34:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:34:10,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514104926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:34:10,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:34:10,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 27 [2022-11-20 09:34:10,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418031397] [2022-11-20 09:34:10,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:34:10,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:34:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:34:10,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:34:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=487, Unknown=21, NotChecked=196, Total=812 [2022-11-20 09:34:10,193 INFO L87 Difference]: Start difference. First operand 708 states and 1692 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-20 09:34:32,129 WARN L233 SmtUtils]: Spent 18.49s on a formula simplification. DAG size of input: 101 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:34:34,266 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select .cse7 .cse3))) (let ((.cse0 (* .cse1 4)) (.cse6 (+ 1608 |c_~#queue~0.offset|))) (and (<= (+ .cse0 |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1517| Int)) (let ((.cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1517| 4)))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1517| .cse1)) (forall ((v_ArrVal_1671 Int)) (let ((.cse2 (store .cse7 .cse8 v_ArrVal_1671))) (or (= 400 (select .cse2 .cse3)) (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1673 Int) (v_ArrVal_1674 (Array Int Int))) (< (* 4 (select (select (store (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse6 v_ArrVal_1673)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1674))) (store .cse4 |c_~#queue~0.base| (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 .cse3 (+ (select .cse5 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1677) |c_~#queue~0.base|) .cse3)) 1609))))) (not (<= 0 .cse8))))) (<= 0 (+ .cse0 |c_~#queue~0.offset|)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1517| Int)) (let ((.cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1517| 4)))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1517| .cse1)) (forall ((v_ArrVal_1671 Int)) (let ((.cse9 (store .cse7 .cse12 v_ArrVal_1671))) (or (= 400 (select .cse9 .cse3)) (forall ((v_prenex_24 Int) (v_prenex_25 (Array Int Int)) (v_prenex_23 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse9 .cse6 v_prenex_24)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_25))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 .cse3 (+ (select .cse11 .cse3) 1))))) |c_~#stored_elements~0.base| v_prenex_23) |c_~#queue~0.base|) .cse3)))))))) (not (<= 0 .cse12))))))))) is different from false [2022-11-20 09:34:55,072 WARN L233 SmtUtils]: Spent 18.49s on a formula simplification. DAG size of input: 184 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:34:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:56,148 INFO L93 Difference]: Finished difference Result 980 states and 2341 transitions. [2022-11-20 09:34:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:34:56,149 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-20 09:34:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:56,151 INFO L225 Difference]: With dead ends: 980 [2022-11-20 09:34:56,151 INFO L226 Difference]: Without dead ends: 980 [2022-11-20 09:34:56,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=173, Invalid=753, Unknown=24, NotChecked=310, Total=1260 [2022-11-20 09:34:56,153 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 632 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:56,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 124 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 316 Invalid, 0 Unknown, 632 Unchecked, 1.2s Time] [2022-11-20 09:34:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-11-20 09:34:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 708. [2022-11-20 09:34:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 698 states have (on average 2.4240687679083095) internal successors, (1692), 707 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1692 transitions. [2022-11-20 09:34:56,173 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1692 transitions. Word has length 15 [2022-11-20 09:34:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:56,173 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 1692 transitions. [2022-11-20 09:34:56,173 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-20 09:34:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1692 transitions. [2022-11-20 09:34:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:34:56,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:56,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:56,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-20 09:34:56,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 09:34:56,381 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:34:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1330384569, now seen corresponding path program 6 times [2022-11-20 09:34:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:34:56,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776248484] [2022-11-20 09:34:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:34:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:34:58,065 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-20 09:34:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:34:58,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776248484] [2022-11-20 09:34:58,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776248484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:34:58,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987692292] [2022-11-20 09:34:58,066 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:34:58,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:34:58,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:34:58,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:34:58,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 09:34:58,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-20 09:34:58,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:34:58,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:34:58,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:58,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:58,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:34:58,426 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:34:58,426 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 28 treesize of output 36 [2022-11-20 09:34:58,505 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:34:58,506 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-20 09:34:58,949 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-20 09:34:59,392 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-20 09:34:59,672 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-20 09:35:00,158 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-20 09:35:00,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:00,411 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-20 09:35:00,603 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-20 09:35:00,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:00,764 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1774 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1774) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_1774 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1774) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:35:01,062 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1774 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1774) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1774 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1774) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:35:01,098 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1771 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1771))) (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_1774) |c_~#queue~0.base|) .cse3) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1771 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1771))) (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_1774) |c_~#queue~0.base|) .cse3) 4)))))) is different from false [2022-11-20 09:35:01,161 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1770 Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1771 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1770)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1771))) (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_1774) |c_~#queue~0.base|) .cse5) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1770 Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1771 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1770)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1771))) (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_1774) |c_~#queue~0.base|) .cse5) 4)))))) is different from false [2022-11-20 09:35:01,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:35:01,235 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-20 09:35:07,854 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select .cse3 .cse2)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (or (forall ((v_ArrVal_1770 Int) (v_ArrVal_1774 (Array Int Int)) (v_ArrVal_1771 (Array Int Int)) (v_ArrVal_1768 Int)) (< (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1768) .cse4 v_ArrVal_1770)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1771))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1774) |c_~#queue~0.base|) .cse2) 4) 1609)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| .cse5)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| .cse5)) (forall ((v_prenex_26 Int) (v_prenex_28 (Array Int Int)) (v_prenex_27 (Array Int Int)) (v_ArrVal_1768 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1521| 4) |c_~#queue~0.offset|) v_ArrVal_1768) .cse4 v_prenex_26)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_28))) (store .cse6 |c_~#queue~0.base| (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 .cse2 (+ (select .cse7 .cse2) 1))))) |c_~#stored_elements~0.base| v_prenex_27) |c_~#queue~0.base|) .cse2)))))))))) is different from false [2022-11-20 09:35:07,972 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-20 09:35:07,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987692292] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:35:07,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:35:07,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-20 09:35:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967201782] [2022-11-20 09:35:07,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:07,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 09:35:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 09:35:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=17, NotChecked=230, Total=756 [2022-11-20 09:35:07,975 INFO L87 Difference]: Start difference. First operand 708 states and 1692 transitions. Second operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:17,909 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 101 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:35:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:19,239 INFO L93 Difference]: Finished difference Result 809 states and 1940 transitions. [2022-11-20 09:35:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:35:19,239 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 09:35:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:35:19,242 INFO L225 Difference]: With dead ends: 809 [2022-11-20 09:35:19,242 INFO L226 Difference]: Without dead ends: 809 [2022-11-20 09:35:19,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 5 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=173, Invalid=822, Unknown=17, NotChecked=320, Total=1332 [2022-11-20 09:35:19,244 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:35:19,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 129 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 441 Invalid, 0 Unknown, 383 Unchecked, 1.6s Time] [2022-11-20 09:35:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-11-20 09:35:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 709. [2022-11-20 09:35:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 699 states have (on average 2.4263233190271816) internal successors, (1696), 708 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1696 transitions. [2022-11-20 09:35:19,262 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1696 transitions. Word has length 15 [2022-11-20 09:35:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:35:19,262 INFO L495 AbstractCegarLoop]: Abstraction has 709 states and 1696 transitions. [2022-11-20 09:35:19,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1696 transitions. [2022-11-20 09:35:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:35:19,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:35:19,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:35:19,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:19,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:19,470 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-20 09:35:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1339696659, now seen corresponding path program 7 times [2022-11-20 09:35:19,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:19,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642014993] [2022-11-20 09:35:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:19,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:21,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-20 09:35:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642014993] [2022-11-20 09:35:21,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642014993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:35:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462101488] [2022-11-20 09:35:21,425 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:35:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:21,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:21,427 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:21,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 09:35:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:21,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-20 09:35:21,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:21,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:21,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:21,735 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:35:21,735 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 28 treesize of output 36 [2022-11-20 09:35:21,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:21,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:21,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:21,758 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-20 09:35:21,832 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:35:21,832 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-20 09:35:22,401 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-20 09:35:22,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-20 09:35:23,018 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-20 09:35:23,673 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-20 09:35:23,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:23,872 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-20 09:35:24,051 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-20 09:35:24,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:24,192 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1873 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|) .cse0))))) (forall ((v_ArrVal_1873 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|) .cse0))) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:35:24,223 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1873 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1873 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:35:24,271 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1873 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1873 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-20 09:35:24,304 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1870))) (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_1873) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1870))) (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_1873) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:35:24,412 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1869 Int) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 (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_1869)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1870))) (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_1873) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1869 Int) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 (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_1869)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1870))) (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_1873) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:35:26,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1869 Int) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1866 Int)) (<= 0 (+ (* (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1866) .cse5 v_ArrVal_1869)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1870))) (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_1873) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1869 Int) (v_ArrVal_1873 (Array Int Int)) (v_ArrVal_1870 (Array Int Int)) (v_ArrVal_1866 Int)) (<= (+ (* (select (select (store (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_1866) .cse5 v_ArrVal_1869)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1870))) (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse8 .cse2 (+ (select .cse8 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|) .cse6) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:35:39,865 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-20 09:35:39,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462101488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:35:39,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:35:39,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-20 09:35:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978211533] [2022-11-20 09:35:39,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:35:39,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 09:35:39,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:35:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 09:35:39,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=338, Unknown=8, NotChecked=258, Total=702 [2022-11-20 09:35:39,868 INFO L87 Difference]: Start difference. First operand 709 states and 1696 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:35:49,610 INFO L93 Difference]: Finished difference Result 866 states and 2080 transitions. [2022-11-20 09:35:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:35:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 09:35:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:35:49,613 INFO L225 Difference]: With dead ends: 866 [2022-11-20 09:35:49,613 INFO L226 Difference]: Without dead ends: 866 [2022-11-20 09:35:49,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=170, Invalid=548, Unknown=8, NotChecked=330, Total=1056 [2022-11-20 09:35:49,615 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 121 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 859 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:35:49,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 356 Invalid, 0 Unknown, 859 Unchecked, 1.5s Time] [2022-11-20 09:35:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-11-20 09:35:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 702. [2022-11-20 09:35:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 692 states have (on average 2.4190751445086707) internal successors, (1674), 701 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1674 transitions. [2022-11-20 09:35:49,636 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1674 transitions. Word has length 15 [2022-11-20 09:35:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:35:49,636 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 1674 transitions. [2022-11-20 09:35:49,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:35:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1674 transitions. [2022-11-20 09:35:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:35:49,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:35:49,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:35:49,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 09:35:49,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-20 09:35:49,845 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-20 09:35:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:35:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1414802273, now seen corresponding path program 8 times [2022-11-20 09:35:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:35:49,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451026530] [2022-11-20 09:35:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:35:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:35:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:35:51,841 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-20 09:35:51,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:35:51,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451026530] [2022-11-20 09:35:51,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451026530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:35:51,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924355758] [2022-11-20 09:35:51,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:35:51,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:35:51,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:35:51,843 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:35:51,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 09:35:52,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:35:52,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:35:52,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:35:52,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:35:52,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:52,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:52,175 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:35:52,176 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 28 treesize of output 36 [2022-11-20 09:35:52,263 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:35:52,263 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-20 09:35:52,756 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-20 09:35:53,215 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-20 09:35:53,864 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-20 09:35:54,070 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-20 09:35:54,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:35:54,303 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-20 09:35:54,551 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-20 09:35:54,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:35:54,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (<= (+ (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:35:55,017 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:35:55,052 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (<= (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:35:55,141 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1966 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1966) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_1970 (Array Int Int)) (v_ArrVal_1969 (Array Int Int)) (v_ArrVal_1966 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_1966) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1969) |c_~#stored_elements~0.base| v_ArrVal_1970) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2022-11-20 09:35:55,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:35:55,184 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-20 09:36:02,130 WARN L233 SmtUtils]: Spent 6.10s 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-20 09:36:12,819 WARN L233 SmtUtils]: Spent 8.23s 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-20 09:36:16,581 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-20 09:36:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924355758] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:16,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:36:16,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:36:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493158269] [2022-11-20 09:36:16,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:16,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:36:16,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:16,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:36:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=477, Unknown=17, NotChecked=196, Total=812 [2022-11-20 09:36:16,584 INFO L87 Difference]: Start difference. First operand 702 states and 1674 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-20 09:36:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:36:25,755 INFO L93 Difference]: Finished difference Result 902 states and 2166 transitions. [2022-11-20 09:36:25,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 09:36:25,756 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-20 09:36:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:36:25,758 INFO L225 Difference]: With dead ends: 902 [2022-11-20 09:36:25,758 INFO L226 Difference]: Without dead ends: 902 [2022-11-20 09:36:25,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=227, Invalid=827, Unknown=18, NotChecked=260, Total=1332 [2022-11-20 09:36:25,759 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 203 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:36:25,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 130 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 398 Invalid, 0 Unknown, 795 Unchecked, 1.5s Time] [2022-11-20 09:36:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-11-20 09:36:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 703. [2022-11-20 09:36:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 693 states have (on average 2.41991341991342) internal successors, (1677), 702 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:36:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1677 transitions. [2022-11-20 09:36:25,778 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1677 transitions. Word has length 15 [2022-11-20 09:36:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:36:25,778 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1677 transitions. [2022-11-20 09:36:25,779 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-20 09:36:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1677 transitions. [2022-11-20 09:36:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:36:25,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:36:25,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:36:25,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-20 09:36:25,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:25,987 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-20 09:36:25,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:36:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash -28637913, now seen corresponding path program 1 times [2022-11-20 09:36:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:36:25,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504480663] [2022-11-20 09:36:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:36:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:27,770 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-20 09:36:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:36:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504480663] [2022-11-20 09:36:27,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504480663] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:36:27,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40727451] [2022-11-20 09:36:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:36:27,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:36:27,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:36:27,772 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:36:27,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 09:36:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:36:27,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:36:27,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:36:28,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:28,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:28,100 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:36:28,100 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 28 treesize of output 36 [2022-11-20 09:36:28,177 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:36:28,177 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-20 09:36:28,646 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-20 09:36:29,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-20 09:36:29,455 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-20 09:36:30,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 09:36:30,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:36:30,304 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-20 09:36:30,486 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-20 09:36:30,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:30,614 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2067 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2067) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2067 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2067) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-20 09:36:31,724 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2063 Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (<= (+ (* (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2062))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_2063) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2067) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2063 Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2062 (Array Int Int))) (<= 0 (+ (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2062))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_2063) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2067) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:36:31,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:36:31,785 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-20 09:36:49,510 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-20 09:36:49,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40727451] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:36:49,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:36:49,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:36:49,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751277623] [2022-11-20 09:36:49,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:36:49,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:36:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:36:49,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:36:49,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=547, Unknown=38, NotChecked=102, Total=812 [2022-11-20 09:36:49,512 INFO L87 Difference]: Start difference. First operand 703 states and 1677 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-20 09:37:00,499 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 67 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:37:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:37:03,546 INFO L93 Difference]: Finished difference Result 951 states and 2286 transitions. [2022-11-20 09:37:03,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 09:37:03,547 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-20 09:37:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:37:03,549 INFO L225 Difference]: With dead ends: 951 [2022-11-20 09:37:03,549 INFO L226 Difference]: Without dead ends: 951 [2022-11-20 09:37:03,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=226, Invalid=996, Unknown=46, NotChecked=138, Total=1406 [2022-11-20 09:37:03,551 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:37:03,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 189 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 288 Invalid, 0 Unknown, 617 Unchecked, 1.1s Time] [2022-11-20 09:37:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-11-20 09:37:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 701. [2022-11-20 09:37:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 691 states have (on average 2.418234442836469) internal successors, (1671), 700 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1671 transitions. [2022-11-20 09:37:03,578 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1671 transitions. Word has length 16 [2022-11-20 09:37:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:37:03,579 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1671 transitions. [2022-11-20 09:37:03,579 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-20 09:37:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1671 transitions. [2022-11-20 09:37:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:37:03,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:37:03,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:03,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 09:37:03,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 09:37:03,789 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-20 09:37:03,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash -7396930, now seen corresponding path program 1 times [2022-11-20 09:37:03,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:03,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942368357] [2022-11-20 09:37:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:03,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:03,863 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-20 09:37:03,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:03,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942368357] [2022-11-20 09:37:03,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942368357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:37:03,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:37:03,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:37:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251679491] [2022-11-20 09:37:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:37:03,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:37:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:03,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:37:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:37:03,865 INFO L87 Difference]: Start difference. First operand 701 states and 1671 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-20 09:37:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:37:04,161 INFO L93 Difference]: Finished difference Result 441 states and 912 transitions. [2022-11-20 09:37:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:37:04,162 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-20 09:37:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:37:04,163 INFO L225 Difference]: With dead ends: 441 [2022-11-20 09:37:04,163 INFO L226 Difference]: Without dead ends: 439 [2022-11-20 09:37:04,163 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-20 09:37:04,164 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:37:04,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:37:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-20 09:37:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 431. [2022-11-20 09:37:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 421 states have (on average 2.130641330166271) internal successors, (897), 430 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 897 transitions. [2022-11-20 09:37:04,174 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 897 transitions. Word has length 16 [2022-11-20 09:37:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:37:04,174 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 897 transitions. [2022-11-20 09:37:04,174 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-20 09:37:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 897 transitions. [2022-11-20 09:37:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:37:04,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:37:04,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:04,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-20 09:37:04,176 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:37:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash -343113503, now seen corresponding path program 2 times [2022-11-20 09:37:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:04,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960236341] [2022-11-20 09:37:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:04,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:05,947 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-20 09:37:05,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:05,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960236341] [2022-11-20 09:37:05,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960236341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:37:05,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116098078] [2022-11-20 09:37:05,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:37:05,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:37:05,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:37:05,949 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:37:05,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 09:37:06,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:37:06,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:37:06,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-20 09:37:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:37:06,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:06,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:06,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 32 [2022-11-20 09:37:06,519 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-20 09:37:06,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-20 09:37:07,149 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-20 09:37:07,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-20 09:37:07,702 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-20 09:37:08,380 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-20 09:37:08,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-20 09:37:08,736 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-20 09:37:08,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:37:08,745 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-20 09:37:08,894 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2203 (Array Int Int))) (< (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2203) |c_~#queue~0.base|) .cse0)) 1605)) (forall ((v_ArrVal_2203 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2203) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:37:08,923 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2203 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2203) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2203 (Array Int Int))) (< (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2203) |c_~#queue~0.base|) .cse1) 4) 1605)))) is different from false [2022-11-20 09:37:09,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2199 Int) (v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2198 (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_2198))) (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse1 .cse2 v_ArrVal_2199) .cse3 (+ (select .cse1 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2203) |c_~#queue~0.base|) .cse4) 4)))) (forall ((v_ArrVal_2199 Int) (v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2198 (Array Int Int))) (< (* (select (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2198))) (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store (store .cse6 .cse2 v_ArrVal_2199) .cse3 (+ (select .cse6 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2203) |c_~#queue~0.base|) .cse4) 4) 1605)))) is different from false [2022-11-20 09:37:14,053 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-20 09:37:14,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116098078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:37:14,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:37:14,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-20 09:37:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693534289] [2022-11-20 09:37:14,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:37:14,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 09:37:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:14,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 09:37:14,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=438, Unknown=24, NotChecked=138, Total=702 [2022-11-20 09:37:14,055 INFO L87 Difference]: Start difference. First operand 431 states and 897 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-20 09:37:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:37:18,740 INFO L93 Difference]: Finished difference Result 451 states and 939 transitions. [2022-11-20 09:37:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:37:18,740 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-20 09:37:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:37:18,741 INFO L225 Difference]: With dead ends: 451 [2022-11-20 09:37:18,741 INFO L226 Difference]: Without dead ends: 451 [2022-11-20 09:37:18,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=219, Invalid=1099, Unknown=26, NotChecked=216, Total=1560 [2022-11-20 09:37:18,743 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 380 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:37:18,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 380 Unchecked, 1.2s Time] [2022-11-20 09:37:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-11-20 09:37:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 425. [2022-11-20 09:37:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 415 states have (on average 2.1373493975903615) internal successors, (887), 424 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 887 transitions. [2022-11-20 09:37:18,752 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 887 transitions. Word has length 16 [2022-11-20 09:37:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:37:18,752 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 887 transitions. [2022-11-20 09:37:18,752 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-20 09:37:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 887 transitions. [2022-11-20 09:37:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:37:18,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:37:18,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:18,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 09:37:18,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-20 09:37:18,959 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-20 09:37:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 909194063, now seen corresponding path program 3 times [2022-11-20 09:37:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:18,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034420189] [2022-11-20 09:37:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:20,916 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-20 09:37:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:20,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034420189] [2022-11-20 09:37:20,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034420189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:37:20,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268681332] [2022-11-20 09:37:20,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:37:20,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:37:20,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:37:20,918 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:37:20,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 09:37:21,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 09:37:21,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:37:21,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-20 09:37:21,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:37:21,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:21,297 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:37:21,297 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 28 treesize of output 36 [2022-11-20 09:37:21,380 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:37:21,380 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-20 09:37:21,866 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-20 09:37:22,340 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-20 09:37:22,976 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-20 09:37:23,174 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-20 09:37:23,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:23,407 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-20 09:37:23,671 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-20 09:37:23,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:37:23,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2300 (Array Int Int))) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse0) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2300 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse0) 4)))))) is different from false [2022-11-20 09:37:23,878 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:37:23,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:37:23,943 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:37:24,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:24,369 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-20 09:37:26,451 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_2295 Int) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (< (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_2295) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_37 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_prenex_35) .cse2 .cse3)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_37) |c_~#stored_elements~0.base| v_prenex_36) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-20 09:37:28,496 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (and (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_2294 Int) (v_ArrVal_2295 Int) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int))) (< (+ |c_~#queue~0.offset| (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse0 (store .cse3 .cse4 v_ArrVal_2294))) (store (store .cse0 .cse1 v_ArrVal_2295) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2299) |c_~#stored_elements~0.base| v_ArrVal_2300) |c_~#queue~0.base|) .cse5) 4)) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609))) (forall ((v_ArrVal_2294 Int) (v_prenex_35 Int) (v_prenex_36 (Array Int Int)) (v_prenex_37 (Array Int Int))) (<= 0 (+ (* (select (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse6 (store .cse3 .cse4 v_ArrVal_2294))) (store (store .cse6 .cse1 v_prenex_35) .cse2 (+ (select .cse6 .cse2) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_37) |c_~#stored_elements~0.base| v_prenex_36) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:37:34,273 WARN L233 SmtUtils]: Spent 5.36s 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-20 09:37:34,394 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-20 09:37:34,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268681332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:37:34,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:37:34,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-20 09:37:34,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530430543] [2022-11-20 09:37:34,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:37:34,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 09:37:34,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 09:37:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=411, Unknown=11, NotChecked=282, Total=812 [2022-11-20 09:37:34,397 INFO L87 Difference]: Start difference. First operand 425 states and 887 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-20 09:37:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:37:37,203 INFO L93 Difference]: Finished difference Result 514 states and 1047 transitions. [2022-11-20 09:37:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:37:37,204 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-20 09:37:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:37:37,205 INFO L225 Difference]: With dead ends: 514 [2022-11-20 09:37:37,205 INFO L226 Difference]: Without dead ends: 514 [2022-11-20 09:37:37,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=135, Invalid=528, Unknown=11, NotChecked=318, Total=992 [2022-11-20 09:37:37,206 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 808 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:37:37,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 77 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 808 Unchecked, 1.2s Time] [2022-11-20 09:37:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-11-20 09:37:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 423. [2022-11-20 09:37:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 413 states have (on average 2.135593220338983) internal successors, (882), 422 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 882 transitions. [2022-11-20 09:37:37,214 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 882 transitions. Word has length 16 [2022-11-20 09:37:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:37:37,215 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 882 transitions. [2022-11-20 09:37:37,215 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-20 09:37:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 882 transitions. [2022-11-20 09:37:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:37:37,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:37:37,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:37,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 09:37:37,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 09:37:37,422 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-20 09:37:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:37,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1955257272, now seen corresponding path program 1 times [2022-11-20 09:37:37,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:37,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722689996] [2022-11-20 09:37:37,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:37,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:38,531 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-20 09:37:38,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:38,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722689996] [2022-11-20 09:37:38,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722689996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:37:38,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974080863] [2022-11-20 09:37:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:38,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:37:38,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:37:38,533 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:37:38,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 09:37:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:38,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:37:38,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:37:38,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:38,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:38,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:38,813 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-20 09:37:39,530 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-20 09:37:39,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:37:40,061 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-20 09:37:40,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974080863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:37:40,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:37:40,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3, 3] total 16 [2022-11-20 09:37:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878402109] [2022-11-20 09:37:40,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:37:40,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 09:37:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 09:37:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:37:40,063 INFO L87 Difference]: Start difference. First operand 423 states and 882 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-20 09:37:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:37:44,625 INFO L93 Difference]: Finished difference Result 1034 states and 2097 transitions. [2022-11-20 09:37:44,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 09:37:44,626 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-20 09:37:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:37:44,628 INFO L225 Difference]: With dead ends: 1034 [2022-11-20 09:37:44,628 INFO L226 Difference]: Without dead ends: 1034 [2022-11-20 09:37:44,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=287, Invalid=835, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 09:37:44,629 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 395 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:37:44,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 52 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-20 09:37:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-20 09:37:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 672. [2022-11-20 09:37:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 662 states have (on average 2.095166163141994) internal successors, (1387), 671 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1387 transitions. [2022-11-20 09:37:44,646 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1387 transitions. Word has length 19 [2022-11-20 09:37:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:37:44,646 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 1387 transitions. [2022-11-20 09:37:44,647 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-20 09:37:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1387 transitions. [2022-11-20 09:37:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 09:37:44,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:37:44,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 09:37:44,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 09:37:44,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-20 09:37:44,854 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-20 09:37:44,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:37:44,855 INFO L85 PathProgramCache]: Analyzing trace with hash 11412208, now seen corresponding path program 7 times [2022-11-20 09:37:44,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:37:44,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287432755] [2022-11-20 09:37:44,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:37:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:37:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:49,746 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-20 09:37:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:49,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287432755] [2022-11-20 09:37:49,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287432755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:37:49,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443593631] [2022-11-20 09:37:49,747 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:37:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:37:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:37:49,748 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:37:49,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 09:37:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:37:50,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-20 09:37:50,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:37:50,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:50,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:50,110 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:37:50,110 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 28 treesize of output 36 [2022-11-20 09:37:50,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:50,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:50,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:50,134 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-20 09:37:50,212 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:37:50,212 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-20 09:37:50,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-20 09:37:51,181 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-20 09:37:51,485 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-20 09:37:52,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-20 09:37:52,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:52,432 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-20 09:37:52,848 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 92 treesize of output 85 [2022-11-20 09:37:55,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-11-20 09:37:56,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2022-11-20 09:37:57,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:37:57,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 163 [2022-11-20 09:37:57,763 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-20 09:37:57,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:37:57,938 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2507 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2507) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset|))) (forall ((v_ArrVal_2507 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2507) |c_~#queue~0.base|) .cse0)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-20 09:38:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 09:38:46,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443593631] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:38:46,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:38:46,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 40 [2022-11-20 09:38:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375197478] [2022-11-20 09:38:46,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:38:46,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 09:38:46,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:38:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 09:38:46,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1348, Unknown=53, NotChecked=78, Total=1722 [2022-11-20 09:38:46,280 INFO L87 Difference]: Start difference. First operand 672 states and 1387 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-20 09:39:11,893 WARN L233 SmtUtils]: Spent 8.69s on a formula simplification. DAG size of input: 99 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:39:30,368 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:39:43,705 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 104 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:39:43,782 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select |c_#length| |c_~#queue~0.base|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310| Int) (v_ArrVal_2500 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310| |c_~#queue~0.offset|) (not (<= (+ 1612 |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310|) .cse0)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1551| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2500))) (let ((.cse2 (+ |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310| 1604)) (.cse1 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1551| (select .cse1 .cse2))) (forall ((v_ArrVal_2502 Int) (v_ArrVal_2503 Int) (v_ArrVal_2507 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1551| 4) |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310|) v_ArrVal_2502))) (store (store .cse4 (+ 1608 |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310|) v_ArrVal_2503) .cse2 (+ (select .cse4 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2507) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))))))))) (forall ((v_ArrVal_2507 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2507) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|))) (forall ((|v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310| Int) (v_ArrVal_2500 (Array Int Int))) (or (< |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310| |c_~#queue~0.offset|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1551| Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2500))) (let ((.cse7 (+ |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310| 1604)) (.cse6 (select .cse8 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1551| (select .cse6 .cse7))) (forall ((v_ArrVal_2502 Int) (v_ArrVal_2503 Int) (v_ArrVal_2507 (Array Int Int))) (<= (+ (* 4 (select (select (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1551| 4) |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310|) v_ArrVal_2502))) (store (store .cse9 (+ 1608 |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310|) v_ArrVal_2503) .cse7 (+ (select .cse9 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2507) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) .cse0)))))) (not (<= (+ 1612 |v_t1Thread1of1ForFork1_enqueue_~q#1.offset_1310|) .cse0)))) (forall ((v_ArrVal_2507 (Array Int Int))) (<= (+ (* 4 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2507) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) .cse0)))) is different from false [2022-11-20 09:40:01,281 WARN L233 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 174 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:40:47,342 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:41:03,171 WARN L233 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 78 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:42:01,837 WARN L233 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 83 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:42:27,273 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 64 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:42:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:42:31,153 INFO L93 Difference]: Finished difference Result 1290 states and 2582 transitions. [2022-11-20 09:42:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 09:42:31,153 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-20 09:42:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:42:31,155 INFO L225 Difference]: With dead ends: 1290 [2022-11-20 09:42:31,155 INFO L226 Difference]: Without dead ends: 1290 [2022-11-20 09:42:31,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 4 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 276.3s TimeCoverageRelationStatistics Valid=623, Invalid=3673, Unknown=134, NotChecked=262, Total=4692 [2022-11-20 09:42:31,156 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 150 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1197 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:42:31,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 96 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 572 Invalid, 0 Unknown, 1197 Unchecked, 2.8s Time] [2022-11-20 09:42:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-20 09:42:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 986. [2022-11-20 09:42:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 976 states have (on average 2.0686475409836067) internal successors, (2019), 985 states have internal predecessors, (2019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:42:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2019 transitions. [2022-11-20 09:42:31,173 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2019 transitions. Word has length 22 [2022-11-20 09:42:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:42:31,174 INFO L495 AbstractCegarLoop]: Abstraction has 986 states and 2019 transitions. [2022-11-20 09:42:31,174 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-20 09:42:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2019 transitions. [2022-11-20 09:42:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 09:42:31,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:42:31,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 09:42:31,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 09:42:31,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:42:31,382 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-20 09:42:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:42:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash 431946282, now seen corresponding path program 8 times [2022-11-20 09:42:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:42:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912067104] [2022-11-20 09:42:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:42:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:42:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:42:35,969 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-20 09:42:35,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:42:35,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912067104] [2022-11-20 09:42:35,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912067104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:42:35,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314843934] [2022-11-20 09:42:35,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:42:35,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:42:35,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:42:35,971 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:42:35,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ae09f87-198b-4aba-a6eb-45c1f533e2b3/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 09:42:36,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:42:36,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:42:36,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-20 09:42:36,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:42:36,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:42:36,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:42:36,350 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:42:36,350 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 28 treesize of output 36 [2022-11-20 09:42:36,434 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-20 09:42:36,434 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-20 09:42:36,978 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-20 09:42:37,566 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-20 09:42:37,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 40 treesize of output 42 [2022-11-20 09:42:38,727 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-20 09:42:38,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:42:38,990 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-20 09:42:39,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 93 [2022-11-20 09:42:39,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 154 treesize of output 149 [2022-11-20 09:42:40,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 117 [2022-11-20 09:42:41,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:42:41,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 219 [2022-11-20 09:42:41,470 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-20 09:42:41,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:42:41,668 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2627 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2627 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:42:41,699 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_2627 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_2627 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-20 09:42:51,787 WARN L233 SmtUtils]: Spent 8.38s 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-20 09:42:52,325 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))) (and (forall ((v_ArrVal_2620 (Array Int Int))) (let ((.cse1 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2620))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse0 (+ |c_~#queue~0.offset| (* (select .cse5 .cse4) 4)))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2621 Int) (v_ArrVal_2623 Int)) (<= (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse0 v_ArrVal_2621))) (store (store .cse2 .cse3 v_ArrVal_2623) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (forall ((v_ArrVal_2620 (Array Int Int))) (let ((.cse7 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_2620))) (let ((.cse9 (select .cse7 |c_~#queue~0.base|))) (let ((.cse10 (+ |c_~#queue~0.offset| (* (select .cse9 .cse4) 4)))) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2621 Int) (v_ArrVal_2623 Int)) (<= 0 (+ (* (select (select (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse9 .cse10 v_ArrVal_2621))) (store (store .cse8 .cse3 v_ArrVal_2623) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse10))))))))) is different from false [2022-11-20 09:42:53,673 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_2617 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2617))) (let ((.cse8 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select .cse8 .cse9))) (or (= .cse0 400) (forall ((v_ArrVal_2620 (Array Int Int))) (let ((.cse1 (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2620))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (+ (* 4 (select .cse5 .cse4)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2621 Int) (v_ArrVal_2623 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store (store .cse1 |c_~#queue~0.base| (let ((.cse2 (store .cse5 .cse6 v_ArrVal_2621))) (store (store .cse2 .cse3 v_ArrVal_2623) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse4) 4)) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse6)))))))))))) (forall ((v_ArrVal_2617 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2617))) (let ((.cse16 (select .cse15 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse10 (select .cse16 .cse9))) (or (= .cse10 400) (forall ((v_ArrVal_2620 (Array Int Int))) (let ((.cse11 (store (store .cse15 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse16 .cse9 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2620))) (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (let ((.cse14 (+ (* 4 (select .cse13 .cse4)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2621 Int) (v_ArrVal_2623 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse13 .cse14 v_ArrVal_2621))) (store (store .cse12 .cse3 v_ArrVal_2623) .cse4 (+ (select .cse12 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse4) 4)))) (not (<= 0 .cse14)))))))))))))) is different from false [2022-11-20 09:42:53,779 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_2615 Int) (v_ArrVal_2617 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_2615)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2617))) (let ((.cse7 (select .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse9 (select .cse7 .cse8))) (or (forall ((v_ArrVal_2620 (Array Int Int))) (let ((.cse0 (store (store .cse6 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2620))) (let ((.cse4 (select .cse0 |c_~#queue~0.base|))) (let ((.cse5 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)))) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2621 Int) (v_ArrVal_2623 Int)) (<= (+ (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse4 .cse5 v_ArrVal_2621))) (store (store .cse1 .cse2 v_ArrVal_2623) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (not (<= 0 .cse5))))))) (= .cse9 400)))))) (forall ((v_ArrVal_2615 Int) (v_ArrVal_2617 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_2615)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2617))) (let ((.cse17 (select .cse16 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse18 (select .cse17 .cse8))) (or (forall ((v_ArrVal_2620 (Array Int Int))) (let ((.cse12 (store (store .cse16 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse17 .cse8 (+ .cse18 1))) |c_~#stored_elements~0.base| v_ArrVal_2620))) (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (let ((.cse15 (+ |c_~#queue~0.offset| (* (select .cse14 .cse3) 4)))) (or (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2621 Int) (v_ArrVal_2623 Int)) (<= 0 (+ (* (select (select (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse14 .cse15 v_ArrVal_2621))) (store (store .cse13 .cse2 v_ArrVal_2623) .cse3 (+ (select .cse13 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse3) 4) |c_~#queue~0.offset|))) (not (<= 0 .cse15))))))) (= .cse18 400)))))))) is different from false [2022-11-20 09:42:53,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:42:53,871 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 937 treesize of output 941 [2022-11-20 09:42:54,192 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (forall ((v_ArrVal_2627 (Array Int Int)) (v_ArrVal_2620 (Array Int Int)) (v_ArrVal_2621 Int) (v_ArrVal_2623 Int) (v_ArrVal_2615 Int) (v_ArrVal_2617 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_2615)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2617))) (let ((.cse22 (select .cse21 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse20 (select .cse22 .cse2))) (let ((.cse16 (store (store .cse21 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse22 .cse2 (+ .cse20 1))) |c_~#stored_elements~0.base| v_ArrVal_2620))) (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (let ((.cse19 (+ |c_~#queue~0.offset| (* (select .cse18 .cse4) 4)))) (or (<= 0 (+ (* (select (select (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse18 .cse19 v_ArrVal_2621))) (store (store .cse17 .cse12 v_ArrVal_2623) .cse4 (+ (select .cse17 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2627) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)) (= .cse20 400) (not (<= 0 .cse19)))))))))))) (and (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (and (forall ((v_prenex_49 Int) (v_prenex_50 (Array Int Int)) (v_prenex_46 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_prenex_49)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_50))) (let ((.cse1 (select .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse3 (select .cse1 .cse2))) (or (not (<= 0 (+ (* (select (select (store (store .cse0 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 (+ 1 .cse3))) |c_~#stored_elements~0.base| v_prenex_46) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))) (= 400 .cse3)))))) .cse7)) (forall ((v_prenex_49 Int) (v_prenex_50 (Array Int Int)) (v_prenex_48 Int) (v_prenex_47 Int) (v_prenex_46 (Array Int Int)) (v_prenex_45 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_prenex_49)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_50))) (let ((.cse15 (select .cse14 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse9 (select .cse15 .cse2))) (let ((.cse10 (store (store .cse14 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse15 .cse2 (+ 1 .cse9))) |c_~#stored_elements~0.base| v_prenex_46))) (let ((.cse13 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|))) (or (not (<= 0 .cse8)) (= 400 .cse9) (< (+ (* (select (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse13 .cse8 v_prenex_47))) (store (store .cse11 .cse12 v_prenex_48) .cse4 (+ 1 (select .cse11 .cse4))))) |c_~#stored_elements~0.base| v_prenex_45) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1609)))))))))) .cse7))) is different from false [2022-11-20 09:43:05,137 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 99 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:43:05,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-20 09:43:05,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314843934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:43:05,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:43:05,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 42 [2022-11-20 09:43:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034953983] [2022-11-20 09:43:05,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:43:05,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-20 09:43:05,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:43:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-20 09:43:05,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1167, Unknown=46, NotChecked=462, Total=1892 [2022-11-20 09:43:05,280 INFO L87 Difference]: Start difference. First operand 986 states and 2019 transitions. Second operand has 44 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 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)