./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:48:27,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:48:27,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:48:27,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:48:27,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:48:27,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:48:27,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:48:27,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:48:27,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:48:27,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:48:27,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:48:27,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:48:27,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:48:27,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:48:27,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:48:27,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:48:27,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:48:27,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:48:27,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:48:27,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:48:27,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:48:27,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:48:27,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:48:27,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:48:27,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:48:27,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:48:27,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:48:27,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:48:27,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:48:27,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:48:27,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:48:27,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:48:27,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:48:27,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:48:27,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:48:27,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:48:27,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:48:27,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:48:27,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:48:27,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:48:27,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:48:27,328 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 16:48:27,368 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:48:27,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:48:27,369 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:48:27,369 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:48:27,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:48:27,371 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:48:27,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:48:27,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:48:27,372 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:48:27,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:48:27,374 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:48:27,374 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:48:27,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:48:27,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:48:27,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:48:27,375 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 16:48:27,375 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 16:48:27,375 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 16:48:27,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:48:27,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 16:48:27,376 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:48:27,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:48:27,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:48:27,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:48:27,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:48:27,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:48:27,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:48:27,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:48:27,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:48:27,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:48:27,379 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_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/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_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2022-11-21 16:48:27,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:48:27,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:48:27,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:48:27,829 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:48:27,830 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:48:27,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-21 16:48:31,148 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:48:31,498 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:48:31,498 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/sv-benchmarks/c/pthread/queue_ok_longest.i [2022-11-21 16:48:31,516 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/data/65d27c8f4/eb59f7db85364e2a8b3db06ccfdde9dc/FLAG8fa09e033 [2022-11-21 16:48:31,532 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/data/65d27c8f4/eb59f7db85364e2a8b3db06ccfdde9dc [2022-11-21 16:48:31,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:48:31,536 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:48:31,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:48:31,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:48:31,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:48:31,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:48:31" (1/1) ... [2022-11-21 16:48:31,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a041b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:31, skipping insertion in model container [2022-11-21 16:48:31,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:48:31" (1/1) ... [2022-11-21 16:48:31,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:48:31,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:48:32,404 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_05405513-a74b-42d7-8a3d-f222e6008281/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-21 16:48:32,415 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_05405513-a74b-42d7-8a3d-f222e6008281/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-21 16:48:32,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:48:32,446 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:48:32,550 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_05405513-a74b-42d7-8a3d-f222e6008281/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2022-11-21 16:48:32,557 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_05405513-a74b-42d7-8a3d-f222e6008281/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2022-11-21 16:48:32,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:48:32,620 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:48:32,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32 WrapperNode [2022-11-21 16:48:32,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:48:32,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:48:32,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:48:32,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:48:32,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,676 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-21 16:48:32,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:48:32,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:48:32,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:48:32,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:48:32,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,709 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:48:32,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:48:32,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:48:32,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:48:32,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (1/1) ... [2022-11-21 16:48:32,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:48:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:48:32,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:48:32,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:48:32,802 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-21 16:48:32,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-21 16:48:32,802 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-21 16:48:32,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-21 16:48:32,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:48:32,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:48:32,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:48:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:48:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-21 16:48:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:48:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:48:32,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:48:32,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:48:32,807 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:48:32,989 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:48:32,991 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:48:33,633 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:48:33,643 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:48:33,643 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-21 16:48:33,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:48:33 BoogieIcfgContainer [2022-11-21 16:48:33,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:48:33,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:48:33,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:48:33,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:48:33,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:48:31" (1/3) ... [2022-11-21 16:48:33,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625fa30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:48:33, skipping insertion in model container [2022-11-21 16:48:33,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:48:32" (2/3) ... [2022-11-21 16:48:33,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625fa30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:48:33, skipping insertion in model container [2022-11-21 16:48:33,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:48:33" (3/3) ... [2022-11-21 16:48:33,654 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-21 16:48:33,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:48:33,675 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-21 16:48:33,675 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:48:33,920 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-21 16:48:33,991 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-21 16:48:34,029 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-21 16:48:34,034 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 291 transitions, 598 flow [2022-11-21 16:48:34,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 291 transitions, 598 flow [2022-11-21 16:48:34,171 INFO L130 PetriNetUnfolder]: 13/289 cut-off events. [2022-11-21 16:48:34,171 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:48:34,183 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-21 16:48:34,194 INFO L119 LiptonReduction]: Number of co-enabled transitions 18694 [2022-11-21 16:48:57,308 INFO L134 LiptonReduction]: Checked pairs total: 59291 [2022-11-21 16:48:57,308 INFO L136 LiptonReduction]: Total number of compositions: 457 [2022-11-21 16:48:57,317 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 109 transitions, 234 flow [2022-11-21 16:48:57,563 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-21 16:48:57,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:48:57,599 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;@544cade2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:48:57,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-11-21 16:48:57,618 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-21 16:48:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-21 16:48:57,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:57,624 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-21 16:48:57,625 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-21 16:48:57,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1279, now seen corresponding path program 1 times [2022-11-21 16:48:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:57,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044204033] [2022-11-21 16:48:57,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:57,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:57,793 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-21 16:48:57,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044204033] [2022-11-21 16:48:57,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044204033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:57,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:57,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-21 16:48:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44458619] [2022-11-21 16:48:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:57,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:48:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:57,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:48:57,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:48:57,863 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-21 16:48:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:58,076 INFO L93 Difference]: Finished difference Result 2668 states and 7688 transitions. [2022-11-21 16:48:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:48:58,078 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-21 16:48:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:58,121 INFO L225 Difference]: With dead ends: 2668 [2022-11-21 16:48:58,121 INFO L226 Difference]: Without dead ends: 2668 [2022-11-21 16:48:58,122 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-21 16:48:58,127 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-21 16:48:58,133 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-21 16:48:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2022-11-21 16:48:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2022-11-21 16:48:58,269 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-21 16:48:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7688 transitions. [2022-11-21 16:48:58,284 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 7688 transitions. Word has length 1 [2022-11-21 16:48:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:58,284 INFO L495 AbstractCegarLoop]: Abstraction has 2668 states and 7688 transitions. [2022-11-21 16:48:58,284 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-21 16:48:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 7688 transitions. [2022-11-21 16:48:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:48:58,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:58,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:48:58,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:48:58,286 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-21 16:48:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1279544, now seen corresponding path program 1 times [2022-11-21 16:48:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:58,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113641554] [2022-11-21 16:48:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:58,614 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-21 16:48:58,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:58,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113641554] [2022-11-21 16:48:58,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113641554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:58,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:58,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:48:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140240688] [2022-11-21 16:48:58,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:58,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:48:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:58,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:48:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:48:58,625 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-21 16:48:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:58,768 INFO L93 Difference]: Finished difference Result 2618 states and 7583 transitions. [2022-11-21 16:48:58,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:48:58,769 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-21 16:48:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:58,788 INFO L225 Difference]: With dead ends: 2618 [2022-11-21 16:48:58,788 INFO L226 Difference]: Without dead ends: 2618 [2022-11-21 16:48:58,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:48:58,789 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-21 16:48:58,790 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-21 16:48:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-11-21 16:48:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2022-11-21 16:48:58,928 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-21 16:48:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 7583 transitions. [2022-11-21 16:48:58,944 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 7583 transitions. Word has length 3 [2022-11-21 16:48:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:58,945 INFO L495 AbstractCegarLoop]: Abstraction has 2618 states and 7583 transitions. [2022-11-21 16:48:58,946 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-21 16:48:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 7583 transitions. [2022-11-21 16:48:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 16:48:58,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:58,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 16:48:58,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:48:58,948 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-21 16:48:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:58,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1279543, now seen corresponding path program 1 times [2022-11-21 16:48:58,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:58,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878040164] [2022-11-21 16:48:58,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:58,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:59,015 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-21 16:48:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:59,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878040164] [2022-11-21 16:48:59,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878040164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:59,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:59,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:48:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880357173] [2022-11-21 16:48:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:59,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:48:59,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:48:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:48:59,019 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-21 16:48:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:59,161 INFO L93 Difference]: Finished difference Result 2568 states and 7478 transitions. [2022-11-21 16:48:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:48:59,162 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-21 16:48:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:59,181 INFO L225 Difference]: With dead ends: 2568 [2022-11-21 16:48:59,181 INFO L226 Difference]: Without dead ends: 2568 [2022-11-21 16:48:59,182 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-21 16:48:59,183 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-21 16:48:59,183 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-21 16:48:59,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-11-21 16:48:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2568. [2022-11-21 16:48:59,261 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-21 16:48:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 7478 transitions. [2022-11-21 16:48:59,278 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 7478 transitions. Word has length 3 [2022-11-21 16:48:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:59,278 INFO L495 AbstractCegarLoop]: Abstraction has 2568 states and 7478 transitions. [2022-11-21 16:48:59,278 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-21 16:48:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 7478 transitions. [2022-11-21 16:48:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:48:59,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:59,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:48:59,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:48:59,280 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-21 16:48:59,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669010, now seen corresponding path program 1 times [2022-11-21 16:48:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:59,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824931896] [2022-11-21 16:48:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:59,400 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-21 16:48:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824931896] [2022-11-21 16:48:59,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824931896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:59,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:59,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:48:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716910037] [2022-11-21 16:48:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:59,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:48:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:48:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:48:59,403 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-21 16:48:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:48:59,528 INFO L93 Difference]: Finished difference Result 1952 states and 5508 transitions. [2022-11-21 16:48:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:48:59,529 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-21 16:48:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:48:59,541 INFO L225 Difference]: With dead ends: 1952 [2022-11-21 16:48:59,541 INFO L226 Difference]: Without dead ends: 1952 [2022-11-21 16:48:59,542 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-21 16:48:59,543 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-21 16:48:59,543 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-21 16:48:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-11-21 16:48:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1952. [2022-11-21 16:48:59,601 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-21 16:48:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 5508 transitions. [2022-11-21 16:48:59,686 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 5508 transitions. Word has length 5 [2022-11-21 16:48:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:48:59,691 INFO L495 AbstractCegarLoop]: Abstraction has 1952 states and 5508 transitions. [2022-11-21 16:48:59,691 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-21 16:48:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 5508 transitions. [2022-11-21 16:48:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:48:59,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:48:59,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:48:59,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:48:59,693 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-21 16:48:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:48:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1229669011, now seen corresponding path program 1 times [2022-11-21 16:48:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:48:59,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810447293] [2022-11-21 16:48:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:48:59,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:48:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:48:59,902 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-21 16:48:59,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:48:59,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810447293] [2022-11-21 16:48:59,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810447293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:48:59,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:48:59,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:48:59,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303105227] [2022-11-21 16:48:59,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:48:59,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:48:59,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:48:59,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:48:59,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:48:59,904 INFO L87 Difference]: Start difference. First operand 1952 states and 5508 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-21 16:49:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:00,012 INFO L93 Difference]: Finished difference Result 1336 states and 3538 transitions. [2022-11-21 16:49:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:49:00,013 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-21 16:49:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:00,021 INFO L225 Difference]: With dead ends: 1336 [2022-11-21 16:49:00,021 INFO L226 Difference]: Without dead ends: 1336 [2022-11-21 16:49:00,021 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-21 16:49:00,022 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:00,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 4 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:49:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-11-21 16:49:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1336. [2022-11-21 16:49:00,056 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-21 16:49:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3538 transitions. [2022-11-21 16:49:00,062 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3538 transitions. Word has length 5 [2022-11-21 16:49:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:00,062 INFO L495 AbstractCegarLoop]: Abstraction has 1336 states and 3538 transitions. [2022-11-21 16:49:00,063 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-21 16:49:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3538 transitions. [2022-11-21 16:49:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:49:00,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:00,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:49:00,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:49:00,064 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-21 16:49:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601986, now seen corresponding path program 1 times [2022-11-21 16:49:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:00,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959646802] [2022-11-21 16:49:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:00,246 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-21 16:49:00,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:00,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959646802] [2022-11-21 16:49:00,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959646802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:00,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:00,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:49:00,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854125083] [2022-11-21 16:49:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:00,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:49:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:00,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:49:00,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:49:00,249 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-21 16:49:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:00,343 INFO L93 Difference]: Finished difference Result 1190 states and 3162 transitions. [2022-11-21 16:49:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:49:00,343 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-21 16:49:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:00,350 INFO L225 Difference]: With dead ends: 1190 [2022-11-21 16:49:00,350 INFO L226 Difference]: Without dead ends: 1190 [2022-11-21 16:49:00,351 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-21 16:49:00,351 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-21 16:49:00,352 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-21 16:49:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-11-21 16:49:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-11-21 16:49:00,380 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-21 16:49:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3162 transitions. [2022-11-21 16:49:00,386 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3162 transitions. Word has length 5 [2022-11-21 16:49:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:00,387 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 3162 transitions. [2022-11-21 16:49:00,387 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-21 16:49:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3162 transitions. [2022-11-21 16:49:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:49:00,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:00,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:49:00,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:49:00,388 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-21 16:49:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1229601987, now seen corresponding path program 1 times [2022-11-21 16:49:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:00,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822981009] [2022-11-21 16:49:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:00,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-21 16:49:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822981009] [2022-11-21 16:49:00,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822981009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:00,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:00,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:49:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786272749] [2022-11-21 16:49:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:00,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:49:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:00,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:49:00,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:49:00,606 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-21 16:49:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:00,710 INFO L93 Difference]: Finished difference Result 1010 states and 2698 transitions. [2022-11-21 16:49:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:49:00,711 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-21 16:49:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:00,717 INFO L225 Difference]: With dead ends: 1010 [2022-11-21 16:49:00,718 INFO L226 Difference]: Without dead ends: 1010 [2022-11-21 16:49:00,718 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-21 16:49:00,719 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-21 16:49:00,719 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-21 16:49:00,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-11-21 16:49:00,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2022-11-21 16:49:00,752 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-21 16:49:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2698 transitions. [2022-11-21 16:49:00,758 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 2698 transitions. Word has length 5 [2022-11-21 16:49:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:00,758 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 2698 transitions. [2022-11-21 16:49:00,758 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-21 16:49:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 2698 transitions. [2022-11-21 16:49:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-21 16:49:00,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:00,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-21 16:49:00,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:49:00,760 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-21 16:49:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1229602043, now seen corresponding path program 1 times [2022-11-21 16:49:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:00,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094826767] [2022-11-21 16:49:00,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:01,469 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-21 16:49:01,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:01,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094826767] [2022-11-21 16:49:01,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094826767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:01,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:01,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:49:01,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125531490] [2022-11-21 16:49:01,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:01,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:49:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:01,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:49:01,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:49:01,471 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-21 16:49:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:01,740 INFO L93 Difference]: Finished difference Result 1016 states and 2711 transitions. [2022-11-21 16:49:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:49:01,742 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-21 16:49:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:01,748 INFO L225 Difference]: With dead ends: 1016 [2022-11-21 16:49:01,748 INFO L226 Difference]: Without dead ends: 1016 [2022-11-21 16:49:01,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-21 16:49:01,749 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-21 16:49:01,749 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-21 16:49:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2022-11-21 16:49:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1011. [2022-11-21 16:49:01,784 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-21 16:49:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2701 transitions. [2022-11-21 16:49:01,788 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 2701 transitions. Word has length 5 [2022-11-21 16:49:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:01,789 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 2701 transitions. [2022-11-21 16:49:01,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-21 16:49:01,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 2701 transitions. [2022-11-21 16:49:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 16:49:01,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:01,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:49:01,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:49:01,792 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-21 16:49:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash -534759366, now seen corresponding path program 1 times [2022-11-21 16:49:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:01,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463795127] [2022-11-21 16:49:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:02,280 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-21 16:49:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:02,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463795127] [2022-11-21 16:49:02,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463795127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:02,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:02,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:49:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608354587] [2022-11-21 16:49:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:02,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:49:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:02,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:49:02,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:49:02,283 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-21 16:49:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:02,449 INFO L93 Difference]: Finished difference Result 1286 states and 3454 transitions. [2022-11-21 16:49:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:49:02,449 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-21 16:49:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:02,457 INFO L225 Difference]: With dead ends: 1286 [2022-11-21 16:49:02,457 INFO L226 Difference]: Without dead ends: 1286 [2022-11-21 16:49:02,457 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-21 16:49:02,458 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:02,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:49:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-11-21 16:49:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1094. [2022-11-21 16:49:02,503 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-21 16:49:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 2973 transitions. [2022-11-21 16:49:02,507 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 2973 transitions. Word has length 6 [2022-11-21 16:49:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:02,507 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 2973 transitions. [2022-11-21 16:49:02,507 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-21 16:49:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 2973 transitions. [2022-11-21 16:49:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 16:49:02,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:02,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:49:02,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:49:02,509 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-21 16:49:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash -537040297, now seen corresponding path program 1 times [2022-11-21 16:49:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:02,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003351637] [2022-11-21 16:49:02,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:02,683 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-21 16:49:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:02,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003351637] [2022-11-21 16:49:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003351637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:02,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:49:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940204153] [2022-11-21 16:49:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:49:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:02,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:49:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:49:02,685 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-21 16:49:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:02,862 INFO L93 Difference]: Finished difference Result 1280 states and 3468 transitions. [2022-11-21 16:49:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:49:02,863 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-21 16:49:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:02,868 INFO L225 Difference]: With dead ends: 1280 [2022-11-21 16:49:02,869 INFO L226 Difference]: Without dead ends: 1280 [2022-11-21 16:49:02,869 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-21 16:49:02,869 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-21 16:49:02,870 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-21 16:49:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-11-21 16:49:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 998. [2022-11-21 16:49:02,896 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-21 16:49:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 2723 transitions. [2022-11-21 16:49:02,900 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 2723 transitions. Word has length 6 [2022-11-21 16:49:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:02,900 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 2723 transitions. [2022-11-21 16:49:02,901 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-21 16:49:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 2723 transitions. [2022-11-21 16:49:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 16:49:02,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:02,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:02,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:49:02,903 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-21 16:49:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1494000732, now seen corresponding path program 1 times [2022-11-21 16:49:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:02,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958999577] [2022-11-21 16:49:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:02,961 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-21 16:49:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:02,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958999577] [2022-11-21 16:49:02,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958999577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:02,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:02,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:49:02,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203096194] [2022-11-21 16:49:02,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:02,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:49:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:02,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:49:02,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:49:02,964 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-21 16:49:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:03,056 INFO L93 Difference]: Finished difference Result 434 states and 998 transitions. [2022-11-21 16:49:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:49:03,057 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-21 16:49:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:03,059 INFO L225 Difference]: With dead ends: 434 [2022-11-21 16:49:03,059 INFO L226 Difference]: Without dead ends: 426 [2022-11-21 16:49:03,059 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-21 16:49:03,060 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-21 16:49:03,060 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-21 16:49:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-21 16:49:03,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 400. [2022-11-21 16:49:03,069 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-21 16:49:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 934 transitions. [2022-11-21 16:49:03,071 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 934 transitions. Word has length 9 [2022-11-21 16:49:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:03,071 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 934 transitions. [2022-11-21 16:49:03,071 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-21 16:49:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 934 transitions. [2022-11-21 16:49:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:49:03,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:03,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:03,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:49:03,073 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-21 16:49:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 740251664, now seen corresponding path program 1 times [2022-11-21 16:49:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:03,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314134937] [2022-11-21 16:49:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:03,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:03,173 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-21 16:49:03,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:03,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314134937] [2022-11-21 16:49:03,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314134937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:03,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:03,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:49:03,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575478456] [2022-11-21 16:49:03,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:03,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:49:03,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:03,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:49:03,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:49:03,175 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-21 16:49:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:03,245 INFO L93 Difference]: Finished difference Result 380 states and 890 transitions. [2022-11-21 16:49:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:49:03,245 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-21 16:49:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:03,247 INFO L225 Difference]: With dead ends: 380 [2022-11-21 16:49:03,247 INFO L226 Difference]: Without dead ends: 380 [2022-11-21 16:49:03,248 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-21 16:49:03,248 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-21 16:49:03,249 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-21 16:49:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-21 16:49:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-21 16:49:03,257 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-21 16:49:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 890 transitions. [2022-11-21 16:49:03,259 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 890 transitions. Word has length 11 [2022-11-21 16:49:03,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:03,259 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 890 transitions. [2022-11-21 16:49:03,259 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-21 16:49:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 890 transitions. [2022-11-21 16:49:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 16:49:03,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:03,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:03,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:49:03,261 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-21 16:49:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 740251665, now seen corresponding path program 1 times [2022-11-21 16:49:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:03,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326664901] [2022-11-21 16:49:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:03,981 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-21 16:49:03,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:03,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326664901] [2022-11-21 16:49:03,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326664901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:03,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:03,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 16:49:03,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872133005] [2022-11-21 16:49:03,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:03,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:49:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:03,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:49:03,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:49:03,984 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-21 16:49:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:04,379 INFO L93 Difference]: Finished difference Result 390 states and 909 transitions. [2022-11-21 16:49:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:49:04,380 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-21 16:49:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:04,382 INFO L225 Difference]: With dead ends: 390 [2022-11-21 16:49:04,382 INFO L226 Difference]: Without dead ends: 390 [2022-11-21 16:49:04,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:49:04,383 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:04,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:49:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-21 16:49:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 384. [2022-11-21 16:49:04,393 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-21 16:49:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 898 transitions. [2022-11-21 16:49:04,395 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 898 transitions. Word has length 11 [2022-11-21 16:49:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:04,395 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 898 transitions. [2022-11-21 16:49:04,395 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-21 16:49:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 898 transitions. [2022-11-21 16:49:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:49:04,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:04,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:49:04,397 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-21 16:49:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1341499408, now seen corresponding path program 1 times [2022-11-21 16:49:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:04,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902742793] [2022-11-21 16:49:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:04,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:05,577 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-21 16:49:05,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:05,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902742793] [2022-11-21 16:49:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902742793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:05,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:05,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:49:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208889204] [2022-11-21 16:49:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:05,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:49:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:05,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:49:05,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:49:05,579 INFO L87 Difference]: Start difference. First operand 384 states and 898 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-21 16:49:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:06,403 INFO L93 Difference]: Finished difference Result 595 states and 1378 transitions. [2022-11-21 16:49:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:49:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-21 16:49:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:06,405 INFO L225 Difference]: With dead ends: 595 [2022-11-21 16:49:06,406 INFO L226 Difference]: Without dead ends: 595 [2022-11-21 16:49:06,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:49:06,406 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 77 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:06,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 21 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:49:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-11-21 16:49:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 428. [2022-11-21 16:49:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 418 states have (on average 2.38755980861244) internal successors, (998), 427 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:06,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 998 transitions. [2022-11-21 16:49:06,420 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 998 transitions. Word has length 12 [2022-11-21 16:49:06,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:06,421 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 998 transitions. [2022-11-21 16:49:06,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-21 16:49:06,421 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 998 transitions. [2022-11-21 16:49:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:49:06,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:06,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:06,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:49:06,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 16:49:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:06,423 INFO L85 PathProgramCache]: Analyzing trace with hash -107929464, now seen corresponding path program 2 times [2022-11-21 16:49:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:06,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535768606] [2022-11-21 16:49:06,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:06,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:07,040 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-21 16:49:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535768606] [2022-11-21 16:49:07,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535768606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:07,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:07,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:49:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349864341] [2022-11-21 16:49:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:07,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:49:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:49:07,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:49:07,042 INFO L87 Difference]: Start difference. First operand 428 states and 998 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-21 16:49:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:07,263 INFO L93 Difference]: Finished difference Result 635 states and 1462 transitions. [2022-11-21 16:49:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:49:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-21 16:49:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:07,266 INFO L225 Difference]: With dead ends: 635 [2022-11-21 16:49:07,266 INFO L226 Difference]: Without dead ends: 635 [2022-11-21 16:49:07,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:49:07,267 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 70 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:49:07,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 14 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:49:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-11-21 16:49:07,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 428. [2022-11-21 16:49:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 418 states have (on average 2.38755980861244) internal successors, (998), 427 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 998 transitions. [2022-11-21 16:49:07,284 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 998 transitions. Word has length 12 [2022-11-21 16:49:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:07,285 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 998 transitions. [2022-11-21 16:49:07,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 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-21 16:49:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 998 transitions. [2022-11-21 16:49:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:49:07,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:07,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:49:07,286 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 16:49:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1471590177, now seen corresponding path program 1 times [2022-11-21 16:49:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:07,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652225584] [2022-11-21 16:49:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:07,480 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-21 16:49:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:07,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652225584] [2022-11-21 16:49:07,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652225584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:49:07,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:49:07,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:49:07,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138631550] [2022-11-21 16:49:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:49:07,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:49:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:49:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 16:49:07,486 INFO L87 Difference]: Start difference. First operand 428 states and 998 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-21 16:49:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:49:07,614 INFO L93 Difference]: Finished difference Result 464 states and 1067 transitions. [2022-11-21 16:49:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:49:07,614 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-21 16:49:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:49:07,616 INFO L225 Difference]: With dead ends: 464 [2022-11-21 16:49:07,616 INFO L226 Difference]: Without dead ends: 464 [2022-11-21 16:49:07,616 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-21 16:49:07,617 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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-21 16:49:07,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 9 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:49:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-11-21 16:49:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2022-11-21 16:49:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 454 states have (on average 2.350220264317181) internal successors, (1067), 463 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1067 transitions. [2022-11-21 16:49:07,630 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1067 transitions. Word has length 12 [2022-11-21 16:49:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:49:07,631 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1067 transitions. [2022-11-21 16:49:07,631 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-21 16:49:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1067 transitions. [2022-11-21 16:49:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-21 16:49:07,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:49:07,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:49:07,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:49:07,632 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-21 16:49:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:49:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1625342350, now seen corresponding path program 1 times [2022-11-21 16:49:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:49:07,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025483567] [2022-11-21 16:49:07,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:49:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:49:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:49:08,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025483567] [2022-11-21 16:49:08,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025483567] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:49:08,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023176565] [2022-11-21 16:49:08,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:49:08,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:49:08,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:49:08,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:49:08,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:49:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:49:08,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-21 16:49:08,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:49:08,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:08,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:08,842 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:49:08,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-21 16:49:08,869 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:49:08,870 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-21 16:49:09,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 16:49:09,179 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-21 16:49:09,396 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-21 16:49:09,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:49:09,465 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-21 16:49:09,516 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-21 16:49:09,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:49:09,615 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_531 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|) .cse1) 4)))) (forall ((v_ArrVal_531 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 16:49:09,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_531 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_531 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_531) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 16:49:09,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:49:09,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 95 [2022-11-21 16:49:15,933 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:49:24,248 WARN L233 SmtUtils]: Spent 6.05s 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-21 16:49:26,617 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-21 16:49:26,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023176565] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:49:26,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:49:26,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-21 16:49:26,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446316395] [2022-11-21 16:49:26,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:49:26,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-21 16:49:26,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:49:26,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-21 16:49:26,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=422, Unknown=12, NotChecked=90, Total=650 [2022-11-21 16:49:26,620 INFO L87 Difference]: Start difference. First operand 464 states and 1067 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:49:30,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:49:38,082 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 92 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:49:40,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:49:54,179 WARN L233 SmtUtils]: Spent 12.59s on a formula simplification. DAG size of input: 109 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:50:20,850 WARN L233 SmtUtils]: Spent 10.83s on a formula simplification. DAG size of input: 109 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:50:24,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:50:30,203 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:50:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:50:35,630 INFO L93 Difference]: Finished difference Result 686 states and 1567 transitions. [2022-11-21 16:50:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 16:50:35,631 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-21 16:50:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:50:35,634 INFO L225 Difference]: With dead ends: 686 [2022-11-21 16:50:35,634 INFO L226 Difference]: Without dead ends: 686 [2022-11-21 16:50:35,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=311, Invalid=1164, Unknown=15, NotChecked=150, Total=1640 [2022-11-21 16:50:35,635 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 142 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:50:35,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 104 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 24 Unknown, 228 Unchecked, 12.5s Time] [2022-11-21 16:50:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-21 16:50:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 514. [2022-11-21 16:50:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 504 states have (on average 2.369047619047619) internal successors, (1194), 513 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:50:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1194 transitions. [2022-11-21 16:50:35,654 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1194 transitions. Word has length 13 [2022-11-21 16:50:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:50:35,654 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 1194 transitions. [2022-11-21 16:50:35,655 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-21 16:50:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1194 transitions. [2022-11-21 16:50:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:50:35,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:50:35,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:50:35,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:50:35,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 16:50:35,876 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-21 16:50:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:50:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 648121009, now seen corresponding path program 1 times [2022-11-21 16:50:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:50:35,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412422200] [2022-11-21 16:50:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:50:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:38,269 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-21 16:50:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:50:38,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412422200] [2022-11-21 16:50:38,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412422200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:50:38,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181442575] [2022-11-21 16:50:38,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:50:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:50:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:50:38,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:50:38,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:50:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:50:38,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-21 16:50:38,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:50:38,500 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-21 16:50:38,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:38,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:38,528 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:50:38,529 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-21 16:50:38,559 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 16:50:38,559 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-21 16:50:38,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:50:38,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:50:38,854 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-21 16:50:38,855 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-21 16:50:39,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:39,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-21 16:50:39,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2022-11-21 16:50:39,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:50:39,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-21 16:50:39,431 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-21 16:50:39,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:50:39,624 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_624 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_624) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_624 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_624) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 16:50:39,650 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_624 (Array Int Int))) (<= 0 (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_624) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_624 (Array Int Int))) (<= (+ (* (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_624) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 16:50:39,680 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_621 Int) (v_ArrVal_624 (Array Int Int))) (<= (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_621) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_624) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_621 Int) (v_ArrVal_624 (Array Int Int))) (<= 0 (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_621) .cse2 .cse3)) |c_~#stored_elements~0.base| v_ArrVal_624) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|)))))) is different from false [2022-11-21 16:50:39,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:50:39,717 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-21 16:50:46,054 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:50:47,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| Int) (v_prenex_3 Int) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_618 Int) (v_prenex_4 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_617))) (let ((.cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| 4) |c_~#queue~0.offset|)) (.cse3 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (* (select (select (store (store .cse0 |c_~#queue~0.base| (let ((.cse1 (store .cse3 .cse4 v_ArrVal_618))) (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_prenex_3) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_prenex_4) |c_~#queue~0.base|) .cse2) 4) 3209) (not (<= 0 .cse4)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1473| (select .cse3 .cse2))))))) is different from false [2022-11-21 16:50:47,471 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-21 16:50:47,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181442575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:50:47,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:50:47,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 26 [2022-11-21 16:50:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385919543] [2022-11-21 16:50:47,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:50:47,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 16:50:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:50:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 16:50:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=455, Unknown=8, NotChecked=188, Total=756 [2022-11-21 16:50:47,475 INFO L87 Difference]: Start difference. First operand 514 states and 1194 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-21 16:51:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:51:05,456 INFO L93 Difference]: Finished difference Result 1003 states and 2318 transitions. [2022-11-21 16:51:05,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:51:05,457 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-21 16:51:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:51:05,460 INFO L225 Difference]: With dead ends: 1003 [2022-11-21 16:51:05,461 INFO L226 Difference]: Without dead ends: 1003 [2022-11-21 16:51:05,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=234, Invalid=893, Unknown=11, NotChecked=268, Total=1406 [2022-11-21 16:51:05,462 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 436 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 77 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:51:05,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 136 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1112 Invalid, 11 Unknown, 564 Unchecked, 7.7s Time] [2022-11-21 16:51:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-11-21 16:51:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 607. [2022-11-21 16:51:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 597 states have (on average 2.4271356783919598) internal successors, (1449), 606 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1449 transitions. [2022-11-21 16:51:05,487 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1449 transitions. Word has length 14 [2022-11-21 16:51:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:51:05,487 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 1449 transitions. [2022-11-21 16:51:05,488 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-21 16:51:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1449 transitions. [2022-11-21 16:51:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 16:51:05,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:51:05,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:05,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:51:05,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:51:05,696 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-21 16:51:05,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1154017767, now seen corresponding path program 2 times [2022-11-21 16:51:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:05,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704132126] [2022-11-21 16:51:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:05,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:07,567 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-21 16:51:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:07,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704132126] [2022-11-21 16:51:07,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704132126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:51:07,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964539234] [2022-11-21 16:51:07,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:51:07,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:07,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:51:07,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:51:07,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:51:07,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:51:07,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-21 16:51:07,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:51:07,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:07,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:07,860 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-21 16:51:08,010 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-21 16:51:08,011 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-21 16:51:08,433 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-21 16:51:08,683 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-21 16:51:09,219 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-21 16:51:09,383 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 74 treesize of output 76 [2022-11-21 16:51:09,525 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-21 16:51:09,646 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-21 16:51:09,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:51:09,654 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-21 16:51:09,742 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_721 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_721) |c_~#queue~0.base|) .cse0) 4) 3205)) (forall ((v_ArrVal_721 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_721) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))))) is different from false [2022-11-21 16:51:12,037 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_720) |c_~#stored_elements~0.base| v_ArrVal_721) |c_~#queue~0.base|) .cse1) 4) 3205)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_720) |c_~#stored_elements~0.base| v_ArrVal_721) |c_~#queue~0.base|) .cse1) 4)))))) is different from false [2022-11-21 16:51:12,070 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= 0 (+ (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_720) |c_~#stored_elements~0.base| v_ArrVal_721) |c_~#queue~0.base|) .cse1) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (< (* (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_720) |c_~#stored_elements~0.base| v_ArrVal_721) |c_~#queue~0.base|) .cse1) 4) 3205)))) is different from false [2022-11-21 16:51:13,218 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-21 16:51:13,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964539234] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:51:13,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:51:13,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-11-21 16:51:13,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767925674] [2022-11-21 16:51:13,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:51:13,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-21 16:51:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:13,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-21 16:51:13,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=12, NotChecked=138, Total=702 [2022-11-21 16:51:13,222 INFO L87 Difference]: Start difference. First operand 607 states and 1449 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-21 16:51:21,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:51:23,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:51:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:51:29,403 INFO L93 Difference]: Finished difference Result 1133 states and 2706 transitions. [2022-11-21 16:51:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 16:51:29,404 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-21 16:51:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:51:29,408 INFO L225 Difference]: With dead ends: 1133 [2022-11-21 16:51:29,408 INFO L226 Difference]: Without dead ends: 1133 [2022-11-21 16:51:29,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=290, Invalid=1111, Unknown=17, NotChecked=222, Total=1640 [2022-11-21 16:51:29,410 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 306 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 53 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:51:29,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 145 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1279 Invalid, 63 Unknown, 429 Unchecked, 10.0s Time] [2022-11-21 16:51:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-11-21 16:51:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 678. [2022-11-21 16:51:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 668 states have (on average 2.4520958083832336) internal successors, (1638), 677 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1638 transitions. [2022-11-21 16:51:29,438 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1638 transitions. Word has length 14 [2022-11-21 16:51:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:51:29,438 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1638 transitions. [2022-11-21 16:51:29,438 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-21 16:51:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1638 transitions. [2022-11-21 16:51:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 16:51:29,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:51:29,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:29,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:51:29,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:29,653 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 16:51:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -551375410, now seen corresponding path program 1 times [2022-11-21 16:51:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:29,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234122239] [2022-11-21 16:51:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:29,766 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-21 16:51:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:29,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234122239] [2022-11-21 16:51:29,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234122239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:51:29,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:51:29,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:51:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092758160] [2022-11-21 16:51:29,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:51:29,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:51:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:29,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:51:29,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:51:29,775 INFO L87 Difference]: Start difference. First operand 678 states and 1638 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-21 16:51:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:51:30,004 INFO L93 Difference]: Finished difference Result 690 states and 1646 transitions. [2022-11-21 16:51:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:51:30,005 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-21 16:51:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:51:30,008 INFO L225 Difference]: With dead ends: 690 [2022-11-21 16:51:30,008 INFO L226 Difference]: Without dead ends: 690 [2022-11-21 16:51:30,008 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-21 16:51:30,009 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:51:30,013 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.2s Time] [2022-11-21 16:51:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-11-21 16:51:30,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 664. [2022-11-21 16:51:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 654 states have (on average 2.448012232415902) internal successors, (1601), 663 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1601 transitions. [2022-11-21 16:51:30,036 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1601 transitions. Word has length 15 [2022-11-21 16:51:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:51:30,037 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 1601 transitions. [2022-11-21 16:51:30,037 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-21 16:51:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1601 transitions. [2022-11-21 16:51:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 16:51:30,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:51:30,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:30,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:51:30,039 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 16:51:30,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1955257272, now seen corresponding path program 1 times [2022-11-21 16:51:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:30,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614735269] [2022-11-21 16:51:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:30,436 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-21 16:51:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:30,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614735269] [2022-11-21 16:51:30,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614735269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:51:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545270647] [2022-11-21 16:51:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:30,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:51:30,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:51:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:30,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 16:51:30,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:51:30,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:30,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:30,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:30,674 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-21 16:51:31,058 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-21 16:51:31,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:51:31,329 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-21 16:51:31,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545270647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:51:31,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:51:31,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-11-21 16:51:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262594651] [2022-11-21 16:51:31,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:51:31,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:51:31,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:51:31,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:51:31,331 INFO L87 Difference]: Start difference. First operand 664 states and 1601 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 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-21 16:51:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:51:32,434 INFO L93 Difference]: Finished difference Result 1315 states and 3110 transitions. [2022-11-21 16:51:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:51:32,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 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-21 16:51:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:51:32,439 INFO L225 Difference]: With dead ends: 1315 [2022-11-21 16:51:32,440 INFO L226 Difference]: Without dead ends: 1315 [2022-11-21 16:51:32,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:51:32,441 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 332 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:51:32,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 27 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:51:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-11-21 16:51:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1292. [2022-11-21 16:51:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1282 states have (on average 2.4032761310452417) internal successors, (3081), 1291 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3081 transitions. [2022-11-21 16:51:32,499 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3081 transitions. Word has length 19 [2022-11-21 16:51:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:51:32,501 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 3081 transitions. [2022-11-21 16:51:32,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 10 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-21 16:51:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3081 transitions. [2022-11-21 16:51:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:51:32,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:51:32,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:32,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-21 16:51:32,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:32,710 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-21 16:51:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash 541648150, now seen corresponding path program 1 times [2022-11-21 16:51:32,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:32,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235712927] [2022-11-21 16:51:32,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:32,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:51:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:33,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235712927] [2022-11-21 16:51:33,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235712927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:51:33,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501820147] [2022-11-21 16:51:33,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:33,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:33,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:51:33,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:51:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:33,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-21 16:51:33,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:51:34,266 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-21 16:51:34,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:34,353 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-21 16:51:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:34,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:51:34,494 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_937 (Array Int Int))) (<= 0 (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset|))) (forall ((v_ArrVal_937 (Array Int Int))) (<= (+ (* (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_937) |c_~#queue~0.base|) .cse0) 4) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))))) is different from false [2022-11-21 16:51:34,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:51:34,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-21 16:51:34,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:51:34,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2022-11-21 16:51:34,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-21 16:51:34,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:51:34,586 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-21 16:51:34,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:51:34,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:34,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-21 16:51:34,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:51:34,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-11-21 16:51:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-21 16:51:35,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501820147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:51:35,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:51:35,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-21 16:51:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313052893] [2022-11-21 16:51:35,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:51:35,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 16:51:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 16:51:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=261, Unknown=1, NotChecked=34, Total=380 [2022-11-21 16:51:35,112 INFO L87 Difference]: Start difference. First operand 1292 states and 3081 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:51:36,098 INFO L93 Difference]: Finished difference Result 1605 states and 3794 transitions. [2022-11-21 16:51:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:51:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:51:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:51:36,104 INFO L225 Difference]: With dead ends: 1605 [2022-11-21 16:51:36,104 INFO L226 Difference]: Without dead ends: 1605 [2022-11-21 16:51:36,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=397, Unknown=1, NotChecked=44, Total=600 [2022-11-21 16:51:36,105 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 376 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:51:36,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 26 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 266 Invalid, 0 Unknown, 78 Unchecked, 0.6s Time] [2022-11-21 16:51:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2022-11-21 16:51:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1292. [2022-11-21 16:51:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1282 states have (on average 2.4032761310452417) internal successors, (3081), 1291 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3081 transitions. [2022-11-21 16:51:36,149 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3081 transitions. Word has length 21 [2022-11-21 16:51:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:51:36,149 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 3081 transitions. [2022-11-21 16:51:36,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 19 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3081 transitions. [2022-11-21 16:51:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-21 16:51:36,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:51:36,151 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:36,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:51:36,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 16:51:36,358 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-21 16:51:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2101431986, now seen corresponding path program 2 times [2022-11-21 16:51:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:36,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649958498] [2022-11-21 16:51:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:36,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:37,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649958498] [2022-11-21 16:51:37,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649958498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:51:37,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45004893] [2022-11-21 16:51:37,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:51:37,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:37,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:37,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:51:37,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:51:37,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:51:37,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:51:37,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-21 16:51:37,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:51:37,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:37,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:37,986 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:51:37,986 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-21 16:51:38,017 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 16:51:38,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-21 16:51:38,288 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-21 16:51:38,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-21 16:51:38,748 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-21 16:51:38,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:38,853 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-21 16:51:39,116 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-21 16:51:39,318 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 88 treesize of output 83 [2022-11-21 16:51:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:51:39,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:51:40,085 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| Int) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1049 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| 4) |c_~#queue~0.offset|) v_ArrVal_1049) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| (select .cse0 .cse1)))))) is different from false [2022-11-21 16:51:40,138 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| Int) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1049 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1043) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| 4) |c_~#queue~0.offset|) v_ArrVal_1049) .cse1)))))) is different from false [2022-11-21 16:51:40,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1041 Int) (v_ArrVal_1043 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| Int) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1049 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1041)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1043) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1047) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| 4) |c_~#queue~0.offset|) v_ArrVal_1049) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1493| (select .cse0 .cse1)))))) is different from false [2022-11-21 16:51:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-21 16:51:40,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45004893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:51:40,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:51:40,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-11-21 16:51:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470251943] [2022-11-21 16:51:40,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:51:40,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 16:51:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:51:40,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 16:51:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=495, Unknown=10, NotChecked=144, Total=756 [2022-11-21 16:51:40,537 INFO L87 Difference]: Start difference. First operand 1292 states and 3081 transitions. Second operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:51:51,308 INFO L93 Difference]: Finished difference Result 1983 states and 4623 transitions. [2022-11-21 16:51:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-21 16:51:51,309 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-21 16:51:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:51:51,316 INFO L225 Difference]: With dead ends: 1983 [2022-11-21 16:51:51,316 INFO L226 Difference]: Without dead ends: 1983 [2022-11-21 16:51:51,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 24 SyntacticMatches, 15 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=590, Invalid=1842, Unknown=30, NotChecked=294, Total=2756 [2022-11-21 16:51:51,318 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1122 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 86 mSolverCounterUnsat, 119 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 119 IncrementalHoareTripleChecker+Unknown, 690 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:51:51,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 133 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1179 Invalid, 119 Unknown, 690 Unchecked, 4.7s Time] [2022-11-21 16:51:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2022-11-21 16:51:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1239. [2022-11-21 16:51:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1229 states have (on average 2.3832384052074858) internal successors, (2929), 1238 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2929 transitions. [2022-11-21 16:51:51,366 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2929 transitions. Word has length 21 [2022-11-21 16:51:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:51:51,367 INFO L495 AbstractCegarLoop]: Abstraction has 1239 states and 2929 transitions. [2022-11-21 16:51:51,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:51:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2929 transitions. [2022-11-21 16:51:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:51:51,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:51:51,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:51:51,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-21 16:51:51,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-21 16:51:51,572 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-11-21 16:51:51,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:51:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -431472802, now seen corresponding path program 3 times [2022-11-21 16:51:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:51:51,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031661376] [2022-11-21 16:51:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:51:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:51:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:51:54,594 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-21 16:51:54,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:51:54,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031661376] [2022-11-21 16:51:54,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031661376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:51:54,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165416336] [2022-11-21 16:51:54,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:51:54,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:51:54,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:51:54,596 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:51:54,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:51:54,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-21 16:51:54,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:51:54,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-21 16:51:54,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:51:54,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:54,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:54,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:54,954 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-21 16:51:54,987 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:51:54,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-21 16:51:55,062 INFO L321 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-21 16:51:55,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-21 16:51:55,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 16:51:55,690 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-21 16:51:56,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-11-21 16:51:56,441 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:51:56,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 75 [2022-11-21 16:51:58,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:51:58,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2022-11-21 16:51:58,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 92 [2022-11-21 16:51:59,001 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-21 16:51:59,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 30 [2022-11-21 16:51:59,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 154 [2022-11-21 16:51:59,965 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-21 16:52:00,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:52:00,200 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 212 treesize of output 214 [2022-11-21 16:52:00,414 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-21 16:52:00,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:52:16,119 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:52:30,601 WARN L233 SmtUtils]: Spent 6.06s 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-21 16:52:44,064 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-21 16:52:44,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165416336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:52:44,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:52:44,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 15] total 41 [2022-11-21 16:52:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595313751] [2022-11-21 16:52:44,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:52:44,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-21 16:52:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-21 16:52:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1494, Unknown=18, NotChecked=0, Total=1806 [2022-11-21 16:52:44,068 INFO L87 Difference]: Start difference. First operand 1239 states and 2929 transitions. Second operand has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:52:59,191 WARN L233 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 140 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:53:43,987 WARN L233 SmtUtils]: Spent 42.77s on a formula simplification. DAG size of input: 184 DAG size of output: 159 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:53:47,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:54:03,841 WARN L233 SmtUtils]: Spent 15.75s on a formula simplification. DAG size of input: 134 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:54:15,649 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 83 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:54:25,793 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 82 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:54:28,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:54:55,539 WARN L233 SmtUtils]: Spent 26.22s on a formula simplification. DAG size of input: 166 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:55:14,083 WARN L233 SmtUtils]: Spent 7.61s on a formula simplification. DAG size of input: 165 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:55:33,434 WARN L233 SmtUtils]: Spent 14.71s on a formula simplification. DAG size of input: 86 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:55:35,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:56:05,725 WARN L233 SmtUtils]: Spent 22.82s on a formula simplification. DAG size of input: 209 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:56:19,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:56:22,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:56:24,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:56:27,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:56:35,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:56:45,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:56:47,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:56:51,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:56:55,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:57:08,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:57:10,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:57:38,831 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:57:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:57:42,520 INFO L93 Difference]: Finished difference Result 1929 states and 4498 transitions. [2022-11-21 16:57:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-21 16:57:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-21 16:57:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:57:42,526 INFO L225 Difference]: With dead ends: 1929 [2022-11-21 16:57:42,526 INFO L226 Difference]: Without dead ends: 1929 [2022-11-21 16:57:42,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2031 ImplicationChecksByTransitivity, 285.0s TimeCoverageRelationStatistics Valid=1173, Invalid=5751, Unknown=216, NotChecked=0, Total=7140 [2022-11-21 16:57:42,529 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 813 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 152 mSolverCounterUnsat, 601 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 4000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 601 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:57:42,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 436 Invalid, 4000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 3247 Invalid, 601 Unknown, 0 Unchecked, 61.1s Time] [2022-11-21 16:57:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2022-11-21 16:57:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1545. [2022-11-21 16:57:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1535 states have (on average 2.377198697068404) internal successors, (3649), 1544 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 3649 transitions. [2022-11-21 16:57:42,578 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 3649 transitions. Word has length 22 [2022-11-21 16:57:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:57:42,578 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 3649 transitions. [2022-11-21 16:57:42,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:57:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 3649 transitions. [2022-11-21 16:57:42,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-21 16:57:42,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:57:42,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-21 16:57:42,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:57:42,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-21 16:57:42,788 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-21 16:57:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:57:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -93712060, now seen corresponding path program 4 times [2022-11-21 16:57:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:57:42,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501362818] [2022-11-21 16:57:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:57:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:57:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:57:44,950 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-21 16:57:44,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:57:44,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501362818] [2022-11-21 16:57:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501362818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:57:44,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330963329] [2022-11-21 16:57:44,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:57:44,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:57:44,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:57:44,952 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:57:44,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:57:45,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:57:45,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:57:45,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-21 16:57:45,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:57:45,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:57:45,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:57:45,227 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 16:57:45,227 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-21 16:57:45,266 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 16:57:45,267 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-21 16:57:45,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-21 16:57:45,827 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-21 16:57:46,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-21 16:57:46,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:57:46,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-21 16:57:46,763 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 63 treesize of output 56 [2022-11-21 16:57:47,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 52 treesize of output 54 [2022-11-21 16:57:47,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-21 16:57:48,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2022-11-21 16:57:48,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:57:48,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 105 [2022-11-21 16:57:48,703 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-21 16:57:48,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:57:49,027 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_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|))) (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|))))) is different from false [2022-11-21 16:57:49,277 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ (select .cse0 .cse2) 1)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int))) (<= (+ (* 4 (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)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int))) (<= 0 (+ (* 4 (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)) |c_~#queue~0.offset|)))))) is different from false [2022-11-21 16:57:49,313 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (<= (+ (* (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| 4) (select |c_#length| |c_~#queue~0.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-21 16:58:03,569 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse0 (+ (select .cse8 .cse9) 1)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1282 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| Int) (v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1280 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1280)) |c_~#stored_elements~0.base| v_ArrVal_1281))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|)) (.cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| 4) |c_~#queue~0.offset|))) (or (< .cse0 v_ArrVal_1280) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| (select .cse1 .cse2))) (<= (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store .cse1 .cse7 v_ArrVal_1282)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store (store .cse4 .cse5 v_ArrVal_1285) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse2) 4) 4) (select |c_#length| |c_~#queue~0.base|)) (not (<= 0 .cse7)))))) (forall ((v_ArrVal_1282 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| Int) (v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1280 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse9 v_ArrVal_1280)) |c_~#stored_elements~0.base| v_ArrVal_1281))) (let ((.cse13 (select .cse12 |c_~#queue~0.base|)) (.cse14 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| 4) |c_~#queue~0.offset|))) (or (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store .cse13 .cse14 v_ArrVal_1282)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse10 |c_~#queue~0.base| (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store (store .cse11 .cse5 v_ArrVal_1285) .cse2 (+ (select .cse11 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse2) 4))) (< .cse0 v_ArrVal_1280) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| (select .cse13 .cse2))) (not (<= 0 .cse14))))))))) is different from false [2022-11-21 16:58:04,123 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse16 (select .cse8 .cse10))) (or (let ((.cse2 (+ .cse16 1)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse9 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1282 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| Int) (v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1280 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1278) .cse10 v_ArrVal_1280)) |c_~#stored_elements~0.base| v_ArrVal_1281))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| 4) |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| (select .cse0 .cse1))) (< .cse2 v_ArrVal_1280) (<= 0 (+ (* 4 (select (select (store (let ((.cse3 (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse7 v_ArrVal_1282)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store (store .cse4 .cse5 v_ArrVal_1285) .cse1 (+ (select .cse4 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|)) (not (<= 0 .cse7)))))) (forall ((v_ArrVal_1282 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| Int) (v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1280 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 .cse9 v_ArrVal_1278) .cse10 v_ArrVal_1280)) |c_~#stored_elements~0.base| v_ArrVal_1281))) (let ((.cse11 (select .cse15 |c_~#queue~0.base|)) (.cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| 4) |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| (select .cse11 .cse1))) (< .cse2 v_ArrVal_1280) (not (<= 0 .cse12)) (<= (+ (* 4 (select (select (store (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store .cse11 .cse12 v_ArrVal_1282)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse13 |c_~#queue~0.base| (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store (store .cse14 .cse5 v_ArrVal_1285) .cse1 (+ (select .cse14 .cse1) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) (select |c_#length| |c_~#queue~0.base|)))))))) (= .cse16 800)))) is different from false [2022-11-21 16:58:04,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:58:04,170 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 493 treesize of output 497 [2022-11-21 16:58:04,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse17 (select .cse9 .cse11))) (or (let ((.cse8 (+ .cse17 1)) (.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse10 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (forall ((v_ArrVal_1282 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| Int) (v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1280 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_ArrVal_1278) .cse11 v_ArrVal_1280)) |c_~#stored_elements~0.base| v_ArrVal_1281))) (let ((.cse12 (select .cse15 |c_~#queue~0.base|)) (.cse16 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| 4) |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| (select .cse12 .cse4))) (< .cse8 v_ArrVal_1280) (<= 0 (+ (* 4 (select (select (store (let ((.cse13 (store (store .cse15 |c_~#queue~0.base| (store .cse12 .cse16 v_ArrVal_1282)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse13 |c_~#queue~0.base| (let ((.cse14 (select .cse13 |c_~#queue~0.base|))) (store (store .cse14 .cse3 v_ArrVal_1285) .cse4 (+ (select .cse14 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)) (not (<= 0 .cse16)))))))) (and .cse0 (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_prenex_12 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_prenex_9) .cse11 v_prenex_11)) |c_~#stored_elements~0.base| v_prenex_12))) (let ((.cse6 (select .cse5 |c_~#queue~0.base|)) (.cse7 (+ (* v_prenex_6 4) |c_~#queue~0.offset|))) (or (< (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse1 (store (store .cse5 |c_~#queue~0.base| (store .cse6 .cse7 v_prenex_5)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_10))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store (store .cse2 .cse3 v_prenex_7) .cse4 (+ (select .cse2 .cse4) 1))))) |c_~#stored_elements~0.base| v_prenex_8) |c_~#queue~0.base|) .cse4) 4)) (+ 3209 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (not (<= v_prenex_6 (select .cse6 .cse4))) (< .cse8 v_prenex_11) (not (<= 0 .cse7)))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (and .cse0 (forall ((v_prenex_11 Int) (v_prenex_12 (Array Int Int)) (v_prenex_9 Int)) (or (< .cse8 v_prenex_11) (< (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 .cse10 v_prenex_9) .cse11 v_prenex_11)) |c_~#stored_elements~0.base| v_prenex_12) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) 0)))))))) (= .cse17 800)))) is different from false [2022-11-21 16:58:16,452 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-21 16:58:16,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330963329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:58:16,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:58:16,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 16] total 42 [2022-11-21 16:58:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737290227] [2022-11-21 16:58:16,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:58:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-21 16:58:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:58:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-21 16:58:16,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1188, Unknown=40, NotChecked=462, Total=1892 [2022-11-21 16:58:16,455 INFO L87 Difference]: Start difference. First operand 1545 states and 3649 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) [2022-11-21 16:58:45,991 WARN L233 SmtUtils]: Spent 14.95s on a formula simplification. DAG size of input: 246 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:58:49,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 16:58:51,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:15,881 WARN L233 SmtUtils]: Spent 1.21m on a formula simplification. DAG size of input: 341 DAG size of output: 239 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:00:19,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:21,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:23,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:25,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:27,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:29,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:29,166 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (<= (+ (* (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| 4) (select |c_#length| |c_~#queue~0.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|))) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse21 (select .cse15 .cse3))) (or (let ((.cse14 (+ .cse21 1)) (.cse10 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (forall ((v_ArrVal_1282 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| Int) (v_ArrVal_1285 Int) (v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1278 Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1280 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse2 v_ArrVal_1278) .cse3 v_ArrVal_1280)) |c_~#stored_elements~0.base| v_ArrVal_1281))) (let ((.cse16 (select .cse19 |c_~#queue~0.base|)) (.cse20 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| 4) |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_1506| (select .cse16 .cse4))) (< .cse14 v_ArrVal_1280) (<= 0 (+ (* 4 (select (select (store (let ((.cse17 (store (store .cse19 |c_~#queue~0.base| (store .cse16 .cse20 v_ArrVal_1282)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1284))) (store .cse17 |c_~#queue~0.base| (let ((.cse18 (select .cse17 |c_~#queue~0.base|))) (store (store .cse18 .cse10 v_ArrVal_1285) .cse4 (+ (select .cse18 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse4)) |c_~#queue~0.offset|)) (not (<= 0 .cse20)))))))) (and .cse7 (forall ((v_prenex_6 Int) (v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_prenex_12 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse2 v_prenex_9) .cse3 v_prenex_11)) |c_~#stored_elements~0.base| v_prenex_12))) (let ((.cse12 (select .cse11 |c_~#queue~0.base|)) (.cse13 (+ (* v_prenex_6 4) |c_~#queue~0.offset|))) (or (< (+ |c_~#queue~0.offset| (* (select (select (store (let ((.cse8 (store (store .cse11 |c_~#queue~0.base| (store .cse12 .cse13 v_prenex_5)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_prenex_10))) (store .cse8 |c_~#queue~0.base| (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (store (store .cse9 .cse10 v_prenex_7) .cse4 (+ (select .cse9 .cse4) 1))))) |c_~#stored_elements~0.base| v_prenex_8) |c_~#queue~0.base|) .cse4) 4)) (+ 3209 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (not (<= v_prenex_6 (select .cse12 .cse4))) (< .cse14 v_prenex_11) (not (<= 0 .cse13)))))) (or (= |c_~#queue~0.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (and .cse7 (forall ((v_prenex_11 Int) (v_prenex_12 (Array Int Int)) (v_prenex_9 Int)) (or (< .cse14 v_prenex_11) (< (+ (* (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse2 v_prenex_9) .cse3 v_prenex_11)) |c_~#stored_elements~0.base| v_prenex_12) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|) 0)))))))) (= .cse21 800)))))) is different from false [2022-11-21 17:00:33,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:35,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-21 17:00:54,207 WARN L233 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:00:54,528 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select |c_#length| |c_~#queue~0.base|)) (.cse3 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (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) .cse2)) (forall ((v_ArrVal_1289 (Array Int Int))) (<= (+ (* 4 (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset| 4) .cse2)) (forall ((v_ArrVal_1289 (Array Int Int))) (<= 0 (+ (* 4 (select (select (store .cse3 |c_~#stored_elements~0.base| v_ArrVal_1289) |c_~#queue~0.base|) .cse1)) |c_~#queue~0.offset|))) (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|)))))) is different from false [2022-11-21 17:00:56,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:00:59,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:01,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:03,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:06,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:08,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:10,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:18,387 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:01:20,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:23,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:25,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:27,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 17:01:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:01:31,118 INFO L93 Difference]: Finished difference Result 2198 states and 5159 transitions. [2022-11-21 17:01:31,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 17:01:31,120 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 22 [2022-11-21 17:01:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:01:31,127 INFO L225 Difference]: With dead ends: 2198 [2022-11-21 17:01:31,127 INFO L226 Difference]: Without dead ends: 2198 [2022-11-21 17:01:31,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 159.1s TimeCoverageRelationStatistics Valid=533, Invalid=2506, Unknown=73, NotChecked=920, Total=4032 [2022-11-21 17:01:31,129 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 589 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 127 mSolverCounterUnsat, 224 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 3795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 224 IncrementalHoareTripleChecker+Unknown, 1176 IncrementalHoareTripleChecker+Unchecked, 64.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:01:31,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 293 Invalid, 3795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2268 Invalid, 224 Unknown, 1176 Unchecked, 64.5s Time] [2022-11-21 17:01:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2022-11-21 17:01:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1511. [2022-11-21 17:01:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1501 states have (on average 2.374417055296469) internal successors, (3564), 1510 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:01:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 3564 transitions. [2022-11-21 17:01:31,180 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 3564 transitions. Word has length 22 [2022-11-21 17:01:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:01:31,180 INFO L495 AbstractCegarLoop]: Abstraction has 1511 states and 3564 transitions. [2022-11-21 17:01:31,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-11-21 17:01:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 3564 transitions. [2022-11-21 17:01:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 17:01:31,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:01:31,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-21 17:01:31,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:01:31,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:31,391 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-21 17:01:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:01:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1075051167, now seen corresponding path program 5 times [2022-11-21 17:01:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:01:31,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610482979] [2022-11-21 17:01:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:01:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:01:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:01:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:35,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:01:35,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610482979] [2022-11-21 17:01:35,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610482979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:01:35,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687763711] [2022-11-21 17:01:35,068 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 17:01:35,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:01:35,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:01:35,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:01:35,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:01:35,553 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-21 17:01:35,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:01:35,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-21 17:01:35,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:01:35,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:35,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:35,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:35,597 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-21 17:01:36,259 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 32 treesize of output 16 [2022-11-21 17:01:36,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:36,416 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 17 treesize of output 19 [2022-11-21 17:01:36,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:36,675 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-21 17:01:36,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 45 [2022-11-21 17:01:36,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:36,863 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 53 treesize of output 40 [2022-11-21 17:01:37,518 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 71 treesize of output 37 [2022-11-21 17:01:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:37,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-11-21 17:01:38,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:01:38,099 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-21 17:01:38,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 58 [2022-11-21 17:01:38,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:38,445 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 63 treesize of output 44 [2022-11-21 17:01:39,042 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 81 treesize of output 41 [2022-11-21 17:01:39,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:01:39,274 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 65 treesize of output 59 [2022-11-21 17:01:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:01:39,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:01:39,745 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_1416 (Array Int Int))) (<= (+ |c_~#queue~0.offset| 4 (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1416) |c_~#queue~0.base|) .cse1))) (select |c_#length| |c_~#queue~0.base|))) (forall ((v_ArrVal_1416 (Array Int Int))) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (select (store .cse0 |c_~#stored_elements~0.base| v_ArrVal_1416) |c_~#queue~0.base|) .cse1))))))) is different from false [2022-11-21 17:01:51,064 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:01:52,058 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3208 |c_~#queue~0.offset|)) (.cse7 (select |c_#length| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse15 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse14 .cse15 (+ (select .cse14 .cse15) 1)))))) (and (forall ((v_ArrVal_1409 (Array Int Int))) (let ((.cse1 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1409))) (let ((.cse5 (select .cse1 |c_~#queue~0.base|))) (let ((.cse6 (* (select .cse5 .cse4) 4))) (or (forall ((v_ArrVal_1411 Int)) (let ((.cse2 (store .cse5 (+ .cse6 |c_~#queue~0.offset|) v_ArrVal_1411))) (let ((.cse0 (select .cse2 .cse4))) (or (= .cse0 800) (forall ((v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1412 Int)) (<= 0 (+ (* (select (select (store (store .cse1 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1412) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1416) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset|))))))) (not (<= (+ .cse6 |c_~#queue~0.offset| 4) .cse7))))))) (forall ((v_ArrVal_1409 (Array Int Int))) (let ((.cse9 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_1409))) (let ((.cse12 (select .cse9 |c_~#queue~0.base|))) (let ((.cse13 (* (select .cse12 .cse4) 4))) (or (forall ((v_ArrVal_1411 Int)) (let ((.cse10 (store .cse12 (+ .cse13 |c_~#queue~0.offset|) v_ArrVal_1411))) (let ((.cse11 (select .cse10 .cse4))) (or (forall ((v_ArrVal_1416 (Array Int Int)) (v_ArrVal_1412 Int)) (<= (+ (* (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse3 v_ArrVal_1412) .cse4 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1416) |c_~#queue~0.base|) .cse4) 4) |c_~#queue~0.offset| 4) .cse7)) (= .cse11 800))))) (not (<= (+ .cse13 |c_~#queue~0.offset| 4) .cse7))))))))) is different from false [2022-11-21 17:02:02,619 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:02:06,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:06,691 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 3010 treesize of output 1432 [2022-11-21 17:02:06,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:06,745 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 1579 treesize of output 1513 [2022-11-21 17:02:06,767 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 1566 treesize of output 1494 [2022-11-21 17:02:06,791 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 1494 treesize of output 1478 [2022-11-21 17:02:06,836 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 1548 treesize of output 1492 [2022-11-21 17:02:06,860 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 1492 treesize of output 1476 [2022-11-21 17:02:06,889 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 1539 treesize of output 1467 [2022-11-21 17:02:06,918 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 1533 treesize of output 1477 [2022-11-21 17:02:06,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-21 17:02:07,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:02:07,970 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 388 treesize of output 304 [2022-11-21 17:02:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-21 17:02:09,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687763711] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:02:09,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:02:09,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 53 [2022-11-21 17:02:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336732374] [2022-11-21 17:02:09,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:02:09,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-21 17:02:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:02:09,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-21 17:02:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=2323, Unknown=36, NotChecked=206, Total=2970 [2022-11-21 17:02:09,348 INFO L87 Difference]: Start difference. First operand 1511 states and 3564 transitions. Second operand has 55 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:02:56,538 INFO L93 Difference]: Finished difference Result 5137 states and 12015 transitions. [2022-11-21 17:02:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-21 17:02:56,538 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 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 30 [2022-11-21 17:02:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:02:56,553 INFO L225 Difference]: With dead ends: 5137 [2022-11-21 17:02:56,554 INFO L226 Difference]: Without dead ends: 5137 [2022-11-21 17:02:56,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 28 SyntacticMatches, 15 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2272 ImplicationChecksByTransitivity, 54.9s TimeCoverageRelationStatistics Valid=1584, Invalid=6578, Unknown=36, NotChecked=358, Total=8556 [2022-11-21 17:02:56,556 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2002 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 5115 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 6184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 5115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 669 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:02:56,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2002 Valid, 658 Invalid, 6184 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [400 Valid, 5115 Invalid, 0 Unknown, 669 Unchecked, 22.0s Time] [2022-11-21 17:02:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2022-11-21 17:02:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 2723. [2022-11-21 17:02:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2713 states have (on average 2.4297825285661627) internal successors, (6592), 2722 states have internal predecessors, (6592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 6592 transitions. [2022-11-21 17:02:56,654 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 6592 transitions. Word has length 30 [2022-11-21 17:02:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:02:56,655 INFO L495 AbstractCegarLoop]: Abstraction has 2723 states and 6592 transitions. [2022-11-21 17:02:56,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.6666666666666667) internal successors, (90), 54 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:02:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 6592 transitions. [2022-11-21 17:02:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 17:02:56,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:02:56,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-21 17:02:56,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:02:56,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05405513-a74b-42d7-8a3d-f222e6008281/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 17:02:56,866 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-21 17:02:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:02:56,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1263617605, now seen corresponding path program 6 times [2022-11-21 17:02:56,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:02:56,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607170050] [2022-11-21 17:02:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:02:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:02:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat