./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- 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-2329fc7 [2022-12-14 08:38:30,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:38:30,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:38:30,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:38:30,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:38:30,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:38:30,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:38:30,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:38:30,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:38:30,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:38:30,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:38:30,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:38:30,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:38:30,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:38:30,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:38:30,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:38:30,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:38:30,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:38:30,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:38:30,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:38:30,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:38:30,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:38:30,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:38:30,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:38:30,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:38:30,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:38:30,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:38:30,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:38:30,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:38:30,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:38:30,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:38:30,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:38:30,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:38:30,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:38:30,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:38:30,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:38:30,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:38:30,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:38:30,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:38:30,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:38:30,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:38:30,544 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 08:38:30,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:38:30,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:38:30,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:38:30,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:38:30,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:38:30,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:38:30,566 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:38:30,567 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:38:30,567 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:38:30,567 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:38:30,567 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:38:30,567 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:38:30,568 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:38:30,568 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:38:30,568 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:38:30,568 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:38:30,568 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:38:30,569 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:38:30,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 08:38:30,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 08:38:30,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:38:30,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:38:30,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:38:30,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:38:30,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:38:30,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:38:30,571 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 08:38:30,571 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 08:38:30,571 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 08:38:30,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:38:30,571 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 08:38:30,572 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:38:30,572 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:38:30,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:38:30,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:38:30,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:38:30,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:38:30,573 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:38:30,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:38:30,573 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:38:30,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:38:30,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:38:30,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/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_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2022-12-14 08:38:30,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:38:30,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:38:30,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:38:30,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:38:30,805 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:38:30,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/stack-1.i [2022-12-14 08:38:33,322 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:38:33,537 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:38:33,537 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/sv-benchmarks/c/pthread/stack-1.i [2022-12-14 08:38:33,547 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/data/f86a20998/eb43fdcc5b8a42f58cfb24d330244184/FLAG5a598200d [2022-12-14 08:38:33,900 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/data/f86a20998/eb43fdcc5b8a42f58cfb24d330244184 [2022-12-14 08:38:33,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:38:33,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:38:33,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:38:33,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:38:33,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:38:33,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:38:33" (1/1) ... [2022-12-14 08:38:33,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e65408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:33, skipping insertion in model container [2022-12-14 08:38:33,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:38:33" (1/1) ... [2022-12-14 08:38:33,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:38:33,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:38:34,210 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_a38b10c0-dc49-4110-86d7-f7c3f823fb19/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2022-12-14 08:38:34,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:38:34,239 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:38:34,265 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_a38b10c0-dc49-4110-86d7-f7c3f823fb19/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2022-12-14 08:38:34,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:38:34,310 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:38:34,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34 WrapperNode [2022-12-14 08:38:34,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:38:34,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:38:34,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:38:34,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:38:34,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,346 INFO L138 Inliner]: procedures = 277, calls = 43, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 152 [2022-12-14 08:38:34,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:38:34,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:38:34,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:38:34,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:38:34,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,366 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:38:34,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:38:34,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:38:34,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:38:34,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (1/1) ... [2022-12-14 08:38:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:38:34,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:34,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:38:34,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:38:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 08:38:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 08:38:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 08:38:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 08:38:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 08:38:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 08:38:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 08:38:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 08:38:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 08:38:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:38:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:38:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:38:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:38:34,436 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 08:38:34,554 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:38:34,556 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:38:34,790 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:38:34,796 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:38:34,796 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 08:38:34,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:38:34 BoogieIcfgContainer [2022-12-14 08:38:34,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:38:34,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:38:34,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:38:34,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:38:34,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:38:33" (1/3) ... [2022-12-14 08:38:34,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f73a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:38:34, skipping insertion in model container [2022-12-14 08:38:34,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:38:34" (2/3) ... [2022-12-14 08:38:34,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f73a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:38:34, skipping insertion in model container [2022-12-14 08:38:34,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:38:34" (3/3) ... [2022-12-14 08:38:34,804 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-12-14 08:38:34,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:38:34,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-12-14 08:38:34,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 08:38:34,886 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 08:38:34,911 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 08:38:34,922 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 190 transitions, 396 flow [2022-12-14 08:38:34,924 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 190 transitions, 396 flow [2022-12-14 08:38:34,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 190 transitions, 396 flow [2022-12-14 08:38:34,977 INFO L130 PetriNetUnfolder]: 10/188 cut-off events. [2022-12-14 08:38:34,977 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 08:38:34,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 188 events. 10/188 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 492 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 134. Up to 3 conditions per place. [2022-12-14 08:38:34,987 INFO L119 LiptonReduction]: Number of co-enabled transitions 9804 [2022-12-14 08:38:38,874 INFO L134 LiptonReduction]: Checked pairs total: 14270 [2022-12-14 08:38:38,874 INFO L136 LiptonReduction]: Total number of compositions: 195 [2022-12-14 08:38:38,880 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 49 transitions, 114 flow [2022-12-14 08:38:38,937 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 782 states, 716 states have (on average 3.1089385474860336) internal successors, (2226), 781 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:38,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:38:38,958 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;@540422d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:38:38,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-12-14 08:38:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 782 states, 716 states have (on average 3.1089385474860336) internal successors, (2226), 781 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 08:38:38,964 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:38,965 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 08:38:38,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 774, now seen corresponding path program 1 times [2022-12-14 08:38:38,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:38,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922667605] [2022-12-14 08:38:38,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:38,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:39,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:39,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922667605] [2022-12-14 08:38:39,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922667605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:39,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:39,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 08:38:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319697674] [2022-12-14 08:38:39,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:39,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 08:38:39,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:39,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 08:38:39,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 08:38:39,088 INFO L87 Difference]: Start difference. First operand has 782 states, 716 states have (on average 3.1089385474860336) internal successors, (2226), 781 states have internal predecessors, (2226), 0 states have call successors, (0), 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-12-14 08:38:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:39,168 INFO L93 Difference]: Finished difference Result 780 states and 2224 transitions. [2022-12-14 08:38:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 08:38:39,170 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-12-14 08:38:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:39,187 INFO L225 Difference]: With dead ends: 780 [2022-12-14 08:38:39,187 INFO L226 Difference]: Without dead ends: 780 [2022-12-14 08:38:39,188 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-12-14 08:38:39,190 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:39,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:38:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-12-14 08:38:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2022-12-14 08:38:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 716 states have (on average 3.106145251396648) internal successors, (2224), 779 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2224 transitions. [2022-12-14 08:38:39,262 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2224 transitions. Word has length 1 [2022-12-14 08:38:39,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:39,262 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 2224 transitions. [2022-12-14 08:38:39,262 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-12-14 08:38:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2224 transitions. [2022-12-14 08:38:39,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 08:38:39,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:39,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 08:38:39,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:38:39,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:39,264 INFO L85 PathProgramCache]: Analyzing trace with hash 762459, now seen corresponding path program 1 times [2022-12-14 08:38:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:39,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868433925] [2022-12-14 08:38:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:39,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868433925] [2022-12-14 08:38:39,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868433925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:39,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:39,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:38:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899043161] [2022-12-14 08:38:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:39,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:39,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:39,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:39,407 INFO L87 Difference]: Start difference. First operand 780 states and 2224 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-12-14 08:38:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:39,455 INFO L93 Difference]: Finished difference Result 754 states and 2169 transitions. [2022-12-14 08:38:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:39,456 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-12-14 08:38:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:39,460 INFO L225 Difference]: With dead ends: 754 [2022-12-14 08:38:39,461 INFO L226 Difference]: Without dead ends: 754 [2022-12-14 08:38:39,461 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-12-14 08:38:39,462 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:39,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:38:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-12-14 08:38:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-12-14 08:38:39,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 698 states have (on average 3.1074498567335245) internal successors, (2169), 753 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2169 transitions. [2022-12-14 08:38:39,490 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 2169 transitions. Word has length 3 [2022-12-14 08:38:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:39,490 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 2169 transitions. [2022-12-14 08:38:39,491 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-12-14 08:38:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 2169 transitions. [2022-12-14 08:38:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 08:38:39,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:39,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 08:38:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:38:39,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash 762460, now seen corresponding path program 1 times [2022-12-14 08:38:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917141555] [2022-12-14 08:38:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:39,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:39,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917141555] [2022-12-14 08:38:39,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917141555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:39,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:39,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:38:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731026027] [2022-12-14 08:38:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:39,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:39,600 INFO L87 Difference]: Start difference. First operand 754 states and 2169 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-12-14 08:38:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:39,651 INFO L93 Difference]: Finished difference Result 728 states and 2114 transitions. [2022-12-14 08:38:39,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:39,651 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-12-14 08:38:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:39,656 INFO L225 Difference]: With dead ends: 728 [2022-12-14 08:38:39,656 INFO L226 Difference]: Without dead ends: 728 [2022-12-14 08:38:39,656 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-12-14 08:38:39,657 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:39,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:38:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-12-14 08:38:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2022-12-14 08:38:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 680 states have (on average 3.1088235294117648) internal successors, (2114), 727 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2114 transitions. [2022-12-14 08:38:39,681 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2114 transitions. Word has length 3 [2022-12-14 08:38:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:39,682 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 2114 transitions. [2022-12-14 08:38:39,682 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-12-14 08:38:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2114 transitions. [2022-12-14 08:38:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 08:38:39,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:39,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 08:38:39,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:38:39,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash 732742749, now seen corresponding path program 1 times [2022-12-14 08:38:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:39,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173400279] [2022-12-14 08:38:39,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:39,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173400279] [2022-12-14 08:38:39,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173400279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:39,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:39,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:38:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469883475] [2022-12-14 08:38:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:39,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:38:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:38:39,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:38:39,780 INFO L87 Difference]: Start difference. First operand 728 states and 2114 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-12-14 08:38:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:39,823 INFO L93 Difference]: Finished difference Result 560 states and 1572 transitions. [2022-12-14 08:38:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:39,823 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-12-14 08:38:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:39,825 INFO L225 Difference]: With dead ends: 560 [2022-12-14 08:38:39,826 INFO L226 Difference]: Without dead ends: 560 [2022-12-14 08:38:39,826 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-12-14 08:38:39,827 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:39,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:38:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-12-14 08:38:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2022-12-14 08:38:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 528 states have (on average 2.977272727272727) internal successors, (1572), 559 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1572 transitions. [2022-12-14 08:38:39,839 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1572 transitions. Word has length 5 [2022-12-14 08:38:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:39,839 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1572 transitions. [2022-12-14 08:38:39,840 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-12-14 08:38:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1572 transitions. [2022-12-14 08:38:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 08:38:39,840 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:39,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 08:38:39,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:38:39,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:39,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 732742750, now seen corresponding path program 1 times [2022-12-14 08:38:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:39,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92853271] [2022-12-14 08:38:39,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:39,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:39,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92853271] [2022-12-14 08:38:39,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92853271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:39,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:39,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 08:38:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327110782] [2022-12-14 08:38:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:39,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:39,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:39,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:39,922 INFO L87 Difference]: Start difference. First operand 560 states and 1572 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-12-14 08:38:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:39,960 INFO L93 Difference]: Finished difference Result 392 states and 1030 transitions. [2022-12-14 08:38:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:39,961 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-12-14 08:38:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:39,962 INFO L225 Difference]: With dead ends: 392 [2022-12-14 08:38:39,962 INFO L226 Difference]: Without dead ends: 392 [2022-12-14 08:38:39,962 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-12-14 08:38:39,963 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:39,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:38:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-12-14 08:38:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-12-14 08:38:39,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 376 states have (on average 2.7393617021276597) internal successors, (1030), 391 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:39,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1030 transitions. [2022-12-14 08:38:39,971 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1030 transitions. Word has length 5 [2022-12-14 08:38:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:39,971 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 1030 transitions. [2022-12-14 08:38:39,971 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-12-14 08:38:39,971 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1030 transitions. [2022-12-14 08:38:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 08:38:39,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:39,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 08:38:39,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:38:39,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:39,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1239635419, now seen corresponding path program 1 times [2022-12-14 08:38:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:39,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510927343] [2022-12-14 08:38:39,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:40,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:40,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510927343] [2022-12-14 08:38:40,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510927343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:40,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:40,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:38:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110258273] [2022-12-14 08:38:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:40,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:40,019 INFO L87 Difference]: Start difference. First operand 392 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-12-14 08:38:40,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:40,080 INFO L93 Difference]: Finished difference Result 558 states and 1422 transitions. [2022-12-14 08:38:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:40,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-12-14 08:38:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:40,082 INFO L225 Difference]: With dead ends: 558 [2022-12-14 08:38:40,082 INFO L226 Difference]: Without dead ends: 558 [2022-12-14 08:38:40,082 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-12-14 08:38:40,083 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:40,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-12-14 08:38:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 520. [2022-12-14 08:38:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 504 states have (on average 2.7301587301587302) internal successors, (1376), 519 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1376 transitions. [2022-12-14 08:38:40,094 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 1376 transitions. Word has length 6 [2022-12-14 08:38:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:40,095 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 1376 transitions. [2022-12-14 08:38:40,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-12-14 08:38:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 1376 transitions. [2022-12-14 08:38:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 08:38:40,095 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:40,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 08:38:40,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:38:40,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1239633747, now seen corresponding path program 1 times [2022-12-14 08:38:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:40,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168458479] [2022-12-14 08:38:40,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:40,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:40,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:40,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168458479] [2022-12-14 08:38:40,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168458479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:40,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:40,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:38:40,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610468989] [2022-12-14 08:38:40,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:40,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:38:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:40,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:38:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:38:40,222 INFO L87 Difference]: Start difference. First operand 520 states and 1376 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 08:38:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:40,302 INFO L93 Difference]: Finished difference Result 511 states and 1343 transitions. [2022-12-14 08:38:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:38:40,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 08:38:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:40,304 INFO L225 Difference]: With dead ends: 511 [2022-12-14 08:38:40,304 INFO L226 Difference]: Without dead ends: 511 [2022-12-14 08:38:40,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:38:40,305 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:40,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:40,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-12-14 08:38:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 478. [2022-12-14 08:38:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 466 states have (on average 2.7145922746781115) internal successors, (1265), 477 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1265 transitions. [2022-12-14 08:38:40,324 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1265 transitions. Word has length 6 [2022-12-14 08:38:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:40,324 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 1265 transitions. [2022-12-14 08:38:40,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 08:38:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1265 transitions. [2022-12-14 08:38:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 08:38:40,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:40,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 08:38:40,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 08:38:40,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1239633748, now seen corresponding path program 1 times [2022-12-14 08:38:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:40,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071198474] [2022-12-14 08:38:40,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:40,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:40,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071198474] [2022-12-14 08:38:40,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071198474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:40,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:40,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:38:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474716222] [2022-12-14 08:38:40,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:40,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:38:40,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:40,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:38:40,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:38:40,518 INFO L87 Difference]: Start difference. First operand 478 states and 1265 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 08:38:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:40,686 INFO L93 Difference]: Finished difference Result 540 states and 1414 transitions. [2022-12-14 08:38:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 08:38:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 08:38:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:40,691 INFO L225 Difference]: With dead ends: 540 [2022-12-14 08:38:40,691 INFO L226 Difference]: Without dead ends: 540 [2022-12-14 08:38:40,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:38:40,692 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:40,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:40,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-12-14 08:38:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 498. [2022-12-14 08:38:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 486 states have (on average 2.7242798353909463) internal successors, (1324), 497 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1324 transitions. [2022-12-14 08:38:40,710 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1324 transitions. Word has length 6 [2022-12-14 08:38:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:40,711 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 1324 transitions. [2022-12-14 08:38:40,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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-12-14 08:38:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1324 transitions. [2022-12-14 08:38:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 08:38:40,712 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:40,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:40,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:38:40,712 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:40,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash -34879145, now seen corresponding path program 1 times [2022-12-14 08:38:40,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:40,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564077001] [2022-12-14 08:38:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:40,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:40,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564077001] [2022-12-14 08:38:40,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564077001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:40,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:40,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:38:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054478184] [2022-12-14 08:38:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:40,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:40,753 INFO L87 Difference]: Start difference. First operand 498 states and 1324 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:40,812 INFO L93 Difference]: Finished difference Result 540 states and 1432 transitions. [2022-12-14 08:38:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 08:38:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:40,817 INFO L225 Difference]: With dead ends: 540 [2022-12-14 08:38:40,817 INFO L226 Difference]: Without dead ends: 540 [2022-12-14 08:38:40,817 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-12-14 08:38:40,818 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:40,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-12-14 08:38:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2022-12-14 08:38:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 528 states have (on average 2.712121212121212) internal successors, (1432), 539 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1432 transitions. [2022-12-14 08:38:40,827 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1432 transitions. Word has length 10 [2022-12-14 08:38:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:40,828 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 1432 transitions. [2022-12-14 08:38:40,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1432 transitions. [2022-12-14 08:38:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:38:40,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:40,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:40,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 08:38:40,829 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1715385377, now seen corresponding path program 1 times [2022-12-14 08:38:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:40,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483689720] [2022-12-14 08:38:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:40,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483689720] [2022-12-14 08:38:40,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483689720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:40,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:40,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:38:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917295586] [2022-12-14 08:38:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:40,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:40,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:40,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:40,863 INFO L87 Difference]: Start difference. First operand 540 states and 1432 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:40,926 INFO L93 Difference]: Finished difference Result 600 states and 1579 transitions. [2022-12-14 08:38:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:40,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 08:38:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:40,929 INFO L225 Difference]: With dead ends: 600 [2022-12-14 08:38:40,929 INFO L226 Difference]: Without dead ends: 600 [2022-12-14 08:38:40,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:40,930 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:40,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-12-14 08:38:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2022-12-14 08:38:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 522 states have (on average 2.703065134099617) internal successors, (1411), 533 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1411 transitions. [2022-12-14 08:38:40,946 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1411 transitions. Word has length 13 [2022-12-14 08:38:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:40,946 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 1411 transitions. [2022-12-14 08:38:40,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1411 transitions. [2022-12-14 08:38:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:38:40,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:40,947 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:40,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 08:38:40,947 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash 299916047, now seen corresponding path program 1 times [2022-12-14 08:38:40,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:40,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483189599] [2022-12-14 08:38:40,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:40,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:41,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:41,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483189599] [2022-12-14 08:38:41,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483189599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:41,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847579826] [2022-12-14 08:38:41,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:41,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:41,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:41,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 08:38:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:41,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 08:38:41,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:38:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:41,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:38:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847579826] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:38:41,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50279925] [2022-12-14 08:38:41,179 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:38:41,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:38:41,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-14 08:38:41,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378763672] [2022-12-14 08:38:41,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:38:41,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 08:38:41,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:41,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 08:38:41,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:38:41,182 INFO L87 Difference]: Start difference. First operand 534 states and 1411 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:41,474 INFO L93 Difference]: Finished difference Result 1250 states and 3185 transitions. [2022-12-14 08:38:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 08:38:41,475 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-12-14 08:38:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:41,481 INFO L225 Difference]: With dead ends: 1250 [2022-12-14 08:38:41,481 INFO L226 Difference]: Without dead ends: 1250 [2022-12-14 08:38:41,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-12-14 08:38:41,482 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:41,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:38:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-12-14 08:38:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 818. [2022-12-14 08:38:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 806 states have (on average 2.7555831265508686) internal successors, (2221), 817 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2221 transitions. [2022-12-14 08:38:41,506 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2221 transitions. Word has length 13 [2022-12-14 08:38:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:41,506 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2221 transitions. [2022-12-14 08:38:41,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2221 transitions. [2022-12-14 08:38:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 08:38:41,507 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:41,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:41,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 08:38:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 08:38:41,708 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:41,708 INFO L85 PathProgramCache]: Analyzing trace with hash 299914376, now seen corresponding path program 1 times [2022-12-14 08:38:41,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:41,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300146173] [2022-12-14 08:38:41,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:42,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:42,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300146173] [2022-12-14 08:38:42,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300146173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:42,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391834087] [2022-12-14 08:38:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:42,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:42,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:42,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 08:38:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:42,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 08:38:42,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:38:42,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:38:42,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:38:42,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:38:42,190 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-12-14 08:38:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:42,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:38:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:42,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391834087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:38:42,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [255090940] [2022-12-14 08:38:42,506 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:38:42,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:38:42,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 19 [2022-12-14 08:38:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000757661] [2022-12-14 08:38:42,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:38:42,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 08:38:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:42,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 08:38:42,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-12-14 08:38:42,508 INFO L87 Difference]: Start difference. First operand 818 states and 2221 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 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-12-14 08:38:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:43,577 INFO L93 Difference]: Finished difference Result 1502 states and 3952 transitions. [2022-12-14 08:38:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 08:38:43,578 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 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-12-14 08:38:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:43,585 INFO L225 Difference]: With dead ends: 1502 [2022-12-14 08:38:43,585 INFO L226 Difference]: Without dead ends: 1502 [2022-12-14 08:38:43,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2022-12-14 08:38:43,586 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 328 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:43,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 0 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 08:38:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-12-14 08:38:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1144. [2022-12-14 08:38:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1132 states have (on average 2.7340989399293285) internal successors, (3095), 1143 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 3095 transitions. [2022-12-14 08:38:43,619 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 3095 transitions. Word has length 13 [2022-12-14 08:38:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:43,620 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 3095 transitions. [2022-12-14 08:38:43,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 20 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-12-14 08:38:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 3095 transitions. [2022-12-14 08:38:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 08:38:43,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:43,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:43,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 08:38:43,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 08:38:43,821 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash 986130337, now seen corresponding path program 1 times [2022-12-14 08:38:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:43,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290549654] [2022-12-14 08:38:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:43,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:43,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290549654] [2022-12-14 08:38:43,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290549654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:43,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:43,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:38:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222509565] [2022-12-14 08:38:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:43,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:43,896 INFO L87 Difference]: Start difference. First operand 1144 states and 3095 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:43,944 INFO L93 Difference]: Finished difference Result 470 states and 1082 transitions. [2022-12-14 08:38:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-12-14 08:38:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:43,946 INFO L225 Difference]: With dead ends: 470 [2022-12-14 08:38:43,947 INFO L226 Difference]: Without dead ends: 470 [2022-12-14 08:38:43,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:43,947 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:43,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:38:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-12-14 08:38:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 440. [2022-12-14 08:38:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 434 states have (on average 2.315668202764977) internal successors, (1005), 439 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1005 transitions. [2022-12-14 08:38:43,959 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1005 transitions. Word has length 18 [2022-12-14 08:38:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:43,959 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 1005 transitions. [2022-12-14 08:38:43,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1005 transitions. [2022-12-14 08:38:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 08:38:43,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:43,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:43,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 08:38:43,960 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1940307059, now seen corresponding path program 1 times [2022-12-14 08:38:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:43,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165004314] [2022-12-14 08:38:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:44,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:44,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165004314] [2022-12-14 08:38:44,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165004314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:44,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:44,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:38:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766179473] [2022-12-14 08:38:44,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:44,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:38:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:44,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:38:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:38:44,051 INFO L87 Difference]: Start difference. First operand 440 states and 1005 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:44,201 INFO L93 Difference]: Finished difference Result 585 states and 1346 transitions. [2022-12-14 08:38:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:38:44,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-12-14 08:38:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:44,204 INFO L225 Difference]: With dead ends: 585 [2022-12-14 08:38:44,204 INFO L226 Difference]: Without dead ends: 585 [2022-12-14 08:38:44,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:38:44,205 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:44,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-12-14 08:38:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 434. [2022-12-14 08:38:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 429 states have (on average 2.3146853146853146) internal successors, (993), 433 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 993 transitions. [2022-12-14 08:38:44,217 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 993 transitions. Word has length 19 [2022-12-14 08:38:44,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:44,218 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 993 transitions. [2022-12-14 08:38:44,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 993 transitions. [2022-12-14 08:38:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 08:38:44,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:44,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 08:38:44,219 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1940307060, now seen corresponding path program 1 times [2022-12-14 08:38:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:44,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835618811] [2022-12-14 08:38:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:44,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835618811] [2022-12-14 08:38:44,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835618811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:44,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 08:38:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237368535] [2022-12-14 08:38:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:44,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 08:38:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 08:38:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-14 08:38:44,506 INFO L87 Difference]: Start difference. First operand 434 states and 993 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:44,964 INFO L93 Difference]: Finished difference Result 568 states and 1279 transitions. [2022-12-14 08:38:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 08:38:44,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 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-12-14 08:38:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:44,967 INFO L225 Difference]: With dead ends: 568 [2022-12-14 08:38:44,967 INFO L226 Difference]: Without dead ends: 568 [2022-12-14 08:38:44,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-12-14 08:38:44,968 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:44,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 08:38:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-12-14 08:38:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 452. [2022-12-14 08:38:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 447 states have (on average 2.302013422818792) internal successors, (1029), 451 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1029 transitions. [2022-12-14 08:38:44,975 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1029 transitions. Word has length 19 [2022-12-14 08:38:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:44,975 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 1029 transitions. [2022-12-14 08:38:44,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1029 transitions. [2022-12-14 08:38:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 08:38:44,975 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:44,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:44,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 08:38:44,976 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1948388473, now seen corresponding path program 1 times [2022-12-14 08:38:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:44,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662215563] [2022-12-14 08:38:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:44,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:38:45,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:45,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662215563] [2022-12-14 08:38:45,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662215563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:45,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:45,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:38:45,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812393762] [2022-12-14 08:38:45,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:45,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:45,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:45,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:45,006 INFO L87 Difference]: Start difference. First operand 452 states and 1029 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:45,070 INFO L93 Difference]: Finished difference Result 628 states and 1397 transitions. [2022-12-14 08:38:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:45,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-12-14 08:38:45,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:45,075 INFO L225 Difference]: With dead ends: 628 [2022-12-14 08:38:45,075 INFO L226 Difference]: Without dead ends: 628 [2022-12-14 08:38:45,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:45,076 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:45,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-12-14 08:38:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 516. [2022-12-14 08:38:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 509 states have (on average 2.24950884086444) internal successors, (1145), 515 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1145 transitions. [2022-12-14 08:38:45,085 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1145 transitions. Word has length 20 [2022-12-14 08:38:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:45,085 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 1145 transitions. [2022-12-14 08:38:45,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1145 transitions. [2022-12-14 08:38:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 08:38:45,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:45,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:45,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 08:38:45,086 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash 619256525, now seen corresponding path program 1 times [2022-12-14 08:38:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:45,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919352308] [2022-12-14 08:38:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:45,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:45,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919352308] [2022-12-14 08:38:45,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919352308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:45,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:45,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 08:38:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381774238] [2022-12-14 08:38:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:45,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 08:38:45,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 08:38:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-14 08:38:45,656 INFO L87 Difference]: Start difference. First operand 516 states and 1145 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:46,506 INFO L93 Difference]: Finished difference Result 684 states and 1503 transitions. [2022-12-14 08:38:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 08:38:46,506 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 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-12-14 08:38:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:46,509 INFO L225 Difference]: With dead ends: 684 [2022-12-14 08:38:46,509 INFO L226 Difference]: Without dead ends: 684 [2022-12-14 08:38:46,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2022-12-14 08:38:46,510 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:46,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 08:38:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-12-14 08:38:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 587. [2022-12-14 08:38:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 580 states have (on average 2.225862068965517) internal successors, (1291), 586 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1291 transitions. [2022-12-14 08:38:46,523 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1291 transitions. Word has length 21 [2022-12-14 08:38:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:46,523 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 1291 transitions. [2022-12-14 08:38:46,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1291 transitions. [2022-12-14 08:38:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 08:38:46,524 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:46,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:46,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 08:38:46,525 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -400696893, now seen corresponding path program 2 times [2022-12-14 08:38:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:46,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100507476] [2022-12-14 08:38:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:47,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:47,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100507476] [2022-12-14 08:38:47,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100507476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:47,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:47,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 08:38:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998015352] [2022-12-14 08:38:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:47,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 08:38:47,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:47,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 08:38:47,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-12-14 08:38:47,212 INFO L87 Difference]: Start difference. First operand 587 states and 1291 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:48,051 INFO L93 Difference]: Finished difference Result 745 states and 1629 transitions. [2022-12-14 08:38:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 08:38:48,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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-12-14 08:38:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:48,054 INFO L225 Difference]: With dead ends: 745 [2022-12-14 08:38:48,054 INFO L226 Difference]: Without dead ends: 745 [2022-12-14 08:38:48,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-12-14 08:38:48,055 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:48,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 08:38:48,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-12-14 08:38:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 577. [2022-12-14 08:38:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 570 states have (on average 2.229824561403509) internal successors, (1271), 576 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1271 transitions. [2022-12-14 08:38:48,064 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1271 transitions. Word has length 21 [2022-12-14 08:38:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:48,064 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 1271 transitions. [2022-12-14 08:38:48,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1271 transitions. [2022-12-14 08:38:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 08:38:48,065 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:48,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:48,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 08:38:48,066 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash -982594051, now seen corresponding path program 3 times [2022-12-14 08:38:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:48,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395708958] [2022-12-14 08:38:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:48,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:48,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:48,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395708958] [2022-12-14 08:38:48,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395708958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:48,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:48,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 08:38:48,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748242038] [2022-12-14 08:38:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:48,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 08:38:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:48,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 08:38:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-14 08:38:48,597 INFO L87 Difference]: Start difference. First operand 577 states and 1271 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:49,409 INFO L93 Difference]: Finished difference Result 671 states and 1477 transitions. [2022-12-14 08:38:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 08:38:49,409 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 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-12-14 08:38:49,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:49,410 INFO L225 Difference]: With dead ends: 671 [2022-12-14 08:38:49,410 INFO L226 Difference]: Without dead ends: 671 [2022-12-14 08:38:49,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2022-12-14 08:38:49,411 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:49,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 08:38:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-12-14 08:38:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 528. [2022-12-14 08:38:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 521 states have (on average 2.2437619961612283) internal successors, (1169), 527 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1169 transitions. [2022-12-14 08:38:49,418 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1169 transitions. Word has length 21 [2022-12-14 08:38:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:49,418 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 1169 transitions. [2022-12-14 08:38:49,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1169 transitions. [2022-12-14 08:38:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 08:38:49,419 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:49,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:49,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 08:38:49,419 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:49,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:49,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1584958174, now seen corresponding path program 1 times [2022-12-14 08:38:49,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:49,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632340420] [2022-12-14 08:38:49,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:38:49,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:49,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632340420] [2022-12-14 08:38:49,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632340420] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:49,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057274220] [2022-12-14 08:38:49,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:49,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:49,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:49,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:49,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 08:38:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:49,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 08:38:49,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:38:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:38:49,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:38:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:38:49,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057274220] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:38:49,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1211509927] [2022-12-14 08:38:49,558 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:38:49,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:38:49,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 08:38:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898514898] [2022-12-14 08:38:49,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:38:49,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 08:38:49,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:49,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 08:38:49,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:38:49,559 INFO L87 Difference]: Start difference. First operand 528 states and 1169 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:49,696 INFO L93 Difference]: Finished difference Result 1234 states and 2631 transitions. [2022-12-14 08:38:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:38:49,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 23 [2022-12-14 08:38:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:49,702 INFO L225 Difference]: With dead ends: 1234 [2022-12-14 08:38:49,702 INFO L226 Difference]: Without dead ends: 1234 [2022-12-14 08:38:49,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:38:49,703 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:49,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-12-14 08:38:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1186. [2022-12-14 08:38:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1179 states have (on average 2.1959287531806617) internal successors, (2589), 1185 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2589 transitions. [2022-12-14 08:38:49,732 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2589 transitions. Word has length 23 [2022-12-14 08:38:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:49,732 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 2589 transitions. [2022-12-14 08:38:49,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2589 transitions. [2022-12-14 08:38:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:38:49,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:49,735 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:49,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 08:38:49,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:49,935 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1389098647, now seen corresponding path program 1 times [2022-12-14 08:38:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:49,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528293657] [2022-12-14 08:38:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:50,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528293657] [2022-12-14 08:38:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528293657] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52514946] [2022-12-14 08:38:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:50,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:50,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:50,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 08:38:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:50,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 08:38:50,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:38:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:38:50,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:38:50,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52514946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:50,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:38:50,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-14 08:38:50,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225931140] [2022-12-14 08:38:50,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:50,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:38:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:50,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:38:50,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:38:50,129 INFO L87 Difference]: Start difference. First operand 1186 states and 2589 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:50,250 INFO L93 Difference]: Finished difference Result 1528 states and 3322 transitions. [2022-12-14 08:38:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:38:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 24 [2022-12-14 08:38:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:50,255 INFO L225 Difference]: With dead ends: 1528 [2022-12-14 08:38:50,255 INFO L226 Difference]: Without dead ends: 1528 [2022-12-14 08:38:50,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-14 08:38:50,256 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:50,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2022-12-14 08:38:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1380. [2022-12-14 08:38:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1373 states have (on average 2.2316096139839767) internal successors, (3064), 1379 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 3064 transitions. [2022-12-14 08:38:50,273 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 3064 transitions. Word has length 24 [2022-12-14 08:38:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:50,274 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 3064 transitions. [2022-12-14 08:38:50,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 3064 transitions. [2022-12-14 08:38:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:38:50,275 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:50,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:50,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 08:38:50,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 08:38:50,476 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1389096976, now seen corresponding path program 1 times [2022-12-14 08:38:50,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:50,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707535858] [2022-12-14 08:38:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:50,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:50,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:50,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707535858] [2022-12-14 08:38:50,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707535858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:50,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:50,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 08:38:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714568861] [2022-12-14 08:38:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:50,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:38:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:38:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 08:38:50,732 INFO L87 Difference]: Start difference. First operand 1380 states and 3064 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:51,147 INFO L93 Difference]: Finished difference Result 2302 states and 5103 transitions. [2022-12-14 08:38:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 08:38:51,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-12-14 08:38:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:51,156 INFO L225 Difference]: With dead ends: 2302 [2022-12-14 08:38:51,156 INFO L226 Difference]: Without dead ends: 2302 [2022-12-14 08:38:51,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-12-14 08:38:51,157 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:51,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:38:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2022-12-14 08:38:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 1416. [2022-12-14 08:38:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1409 states have (on average 2.239886444286728) internal successors, (3156), 1415 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 3156 transitions. [2022-12-14 08:38:51,188 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 3156 transitions. Word has length 24 [2022-12-14 08:38:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:51,188 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 3156 transitions. [2022-12-14 08:38:51,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 3156 transitions. [2022-12-14 08:38:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 08:38:51,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:51,190 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:51,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 08:38:51,190 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1134441592, now seen corresponding path program 1 times [2022-12-14 08:38:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:51,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514331302] [2022-12-14 08:38:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 08:38:51,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:51,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514331302] [2022-12-14 08:38:51,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514331302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:51,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:38:51,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:38:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720602004] [2022-12-14 08:38:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:51,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:38:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:38:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:51,228 INFO L87 Difference]: Start difference. First operand 1416 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:51,286 INFO L93 Difference]: Finished difference Result 1594 states and 3476 transitions. [2022-12-14 08:38:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:38:51,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 24 [2022-12-14 08:38:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:51,291 INFO L225 Difference]: With dead ends: 1594 [2022-12-14 08:38:51,291 INFO L226 Difference]: Without dead ends: 1594 [2022-12-14 08:38:51,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:38:51,292 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:51,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:38:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2022-12-14 08:38:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1460. [2022-12-14 08:38:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1453 states have (on average 2.198898830006882) internal successors, (3195), 1459 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 3195 transitions. [2022-12-14 08:38:51,321 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 3195 transitions. Word has length 24 [2022-12-14 08:38:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:51,321 INFO L495 AbstractCegarLoop]: Abstraction has 1460 states and 3195 transitions. [2022-12-14 08:38:51,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 3195 transitions. [2022-12-14 08:38:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 08:38:51,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:51,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:51,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 08:38:51,324 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -724827920, now seen corresponding path program 2 times [2022-12-14 08:38:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:51,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153725742] [2022-12-14 08:38:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:51,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:51,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153725742] [2022-12-14 08:38:51,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153725742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105935873] [2022-12-14 08:38:51,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:38:51,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:51,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:51,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 08:38:51,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 08:38:51,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:38:51,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 08:38:51,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:38:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:38:52,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:38:52,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105935873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:38:52,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:38:52,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 24 [2022-12-14 08:38:52,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386753257] [2022-12-14 08:38:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:38:52,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 08:38:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 08:38:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2022-12-14 08:38:52,009 INFO L87 Difference]: Start difference. First operand 1460 states and 3195 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:52,821 INFO L93 Difference]: Finished difference Result 2014 states and 4310 transitions. [2022-12-14 08:38:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 08:38:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-12-14 08:38:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:52,826 INFO L225 Difference]: With dead ends: 2014 [2022-12-14 08:38:52,826 INFO L226 Difference]: Without dead ends: 2014 [2022-12-14 08:38:52,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 08:38:52,828 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:52,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 08:38:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2022-12-14 08:38:52,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1600. [2022-12-14 08:38:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1593 states have (on average 2.177652228499686) internal successors, (3469), 1599 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3469 transitions. [2022-12-14 08:38:52,860 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3469 transitions. Word has length 26 [2022-12-14 08:38:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:52,860 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 3469 transitions. [2022-12-14 08:38:52,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3469 transitions. [2022-12-14 08:38:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 08:38:52,862 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:52,862 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-14 08:38:52,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 08:38:53,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 08:38:53,064 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:53,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:53,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1438821775, now seen corresponding path program 2 times [2022-12-14 08:38:53,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:53,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925125915] [2022-12-14 08:38:53,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:53,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:53,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:53,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925125915] [2022-12-14 08:38:53,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925125915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:53,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923302175] [2022-12-14 08:38:53,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:38:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:53,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:53,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 08:38:53,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 08:38:53,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:38:53,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 08:38:53,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:38:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:53,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:38:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:53,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923302175] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:38:53,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1093642541] [2022-12-14 08:38:53,447 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:38:53,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:38:53,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2022-12-14 08:38:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681435675] [2022-12-14 08:38:53,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:38:53,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 08:38:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:53,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 08:38:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-12-14 08:38:53,448 INFO L87 Difference]: Start difference. First operand 1600 states and 3469 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:53,707 INFO L93 Difference]: Finished difference Result 2466 states and 5231 transitions. [2022-12-14 08:38:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 08:38:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 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 27 [2022-12-14 08:38:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:53,713 INFO L225 Difference]: With dead ends: 2466 [2022-12-14 08:38:53,713 INFO L226 Difference]: Without dead ends: 2466 [2022-12-14 08:38:53,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2022-12-14 08:38:53,713 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:53,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:38:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2022-12-14 08:38:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 1828. [2022-12-14 08:38:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1821 states have (on average 2.173531026908292) internal successors, (3958), 1827 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 3958 transitions. [2022-12-14 08:38:53,744 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 3958 transitions. Word has length 27 [2022-12-14 08:38:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:53,744 INFO L495 AbstractCegarLoop]: Abstraction has 1828 states and 3958 transitions. [2022-12-14 08:38:53,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 3958 transitions. [2022-12-14 08:38:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 08:38:53,745 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:53,745 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-14 08:38:53,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 08:38:53,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:53,947 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1438820104, now seen corresponding path program 2 times [2022-12-14 08:38:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:53,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901569766] [2022-12-14 08:38:53,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:53,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:54,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:54,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901569766] [2022-12-14 08:38:54,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901569766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:54,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954942433] [2022-12-14 08:38:54,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:38:54,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:54,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:54,823 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:54,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 08:38:54,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 08:38:54,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:38:54,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 08:38:54,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:38:54,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:38:54,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:38:54,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:38:54,931 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-12-14 08:38:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 08:38:55,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:38:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 08:38:56,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954942433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:38:56,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [465848442] [2022-12-14 08:38:56,023 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:38:56,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:38:56,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 9] total 38 [2022-12-14 08:38:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998917445] [2022-12-14 08:38:56,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:38:56,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 08:38:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:38:56,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 08:38:56,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1433, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 08:38:56,025 INFO L87 Difference]: Start difference. First operand 1828 states and 3958 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:38:58,779 INFO L93 Difference]: Finished difference Result 2578 states and 5301 transitions. [2022-12-14 08:38:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 08:38:58,779 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 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 27 [2022-12-14 08:38:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:38:58,783 INFO L225 Difference]: With dead ends: 2578 [2022-12-14 08:38:58,783 INFO L226 Difference]: Without dead ends: 2578 [2022-12-14 08:38:58,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=620, Invalid=3286, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 08:38:58,784 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1017 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:38:58,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 0 Invalid, 2583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 08:38:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-12-14 08:38:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1594. [2022-12-14 08:38:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1589 states have (on average 2.144115796098175) internal successors, (3407), 1593 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 3407 transitions. [2022-12-14 08:38:58,806 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 3407 transitions. Word has length 27 [2022-12-14 08:38:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:38:58,806 INFO L495 AbstractCegarLoop]: Abstraction has 1594 states and 3407 transitions. [2022-12-14 08:38:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:38:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 3407 transitions. [2022-12-14 08:38:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 08:38:58,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:38:58,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:38:58,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 08:38:59,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 08:38:59,008 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:38:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:38:59,009 INFO L85 PathProgramCache]: Analyzing trace with hash -774950839, now seen corresponding path program 4 times [2022-12-14 08:38:59,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:38:59,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436300744] [2022-12-14 08:38:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:38:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:38:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:38:59,662 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:38:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436300744] [2022-12-14 08:38:59,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436300744] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:38:59,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343132514] [2022-12-14 08:38:59,662 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 08:38:59,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:38:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:38:59,663 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:38:59,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 08:38:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:38:59,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 08:38:59,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:39:00,083 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 22 treesize of output 17 [2022-12-14 08:39:00,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 79 treesize of output 46 [2022-12-14 08:39:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:39:02,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:39:03,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 46 [2022-12-14 08:39:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:39:03,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343132514] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 08:39:03,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 08:39:03,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 15] total 43 [2022-12-14 08:39:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716064963] [2022-12-14 08:39:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:39:03,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 08:39:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:39:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 08:39:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1742, Unknown=1, NotChecked=0, Total=1892 [2022-12-14 08:39:03,389 INFO L87 Difference]: Start difference. First operand 1594 states and 3407 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:39:04,924 INFO L93 Difference]: Finished difference Result 2393 states and 5029 transitions. [2022-12-14 08:39:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 08:39:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-12-14 08:39:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:39:04,928 INFO L225 Difference]: With dead ends: 2393 [2022-12-14 08:39:04,928 INFO L226 Difference]: Without dead ends: 2393 [2022-12-14 08:39:04,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=317, Invalid=3588, Unknown=1, NotChecked=0, Total=3906 [2022-12-14 08:39:04,929 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:39:04,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 08:39:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2022-12-14 08:39:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 1597. [2022-12-14 08:39:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1592 states have (on average 2.1589195979899496) internal successors, (3437), 1596 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 3437 transitions. [2022-12-14 08:39:04,951 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 3437 transitions. Word has length 28 [2022-12-14 08:39:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:39:04,951 INFO L495 AbstractCegarLoop]: Abstraction has 1597 states and 3437 transitions. [2022-12-14 08:39:04,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 3437 transitions. [2022-12-14 08:39:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 08:39:04,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:39:04,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:39:04,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 08:39:05,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 08:39:05,154 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:39:05,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:39:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 829900303, now seen corresponding path program 5 times [2022-12-14 08:39:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:39:05,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108677833] [2022-12-14 08:39:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:39:05,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:39:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:39:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:39:05,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:39:05,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108677833] [2022-12-14 08:39:05,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108677833] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:39:05,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758933963] [2022-12-14 08:39:05,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:39:05,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:39:05,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:39:05,969 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:39:05,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 08:39:06,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 08:39:06,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:39:06,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 08:39:06,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:39:06,093 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-14 08:39:06,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-14 08:39:06,319 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 22 treesize of output 17 [2022-12-14 08:39:06,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-14 08:39:06,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 111 treesize of output 46 [2022-12-14 08:39:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:39:07,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:39:07,364 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_717) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294))) is different from false [2022-12-14 08:39:07,370 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_717 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_717) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-14 08:39:07,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:39:07,378 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-12-14 08:39:07,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:39:07,386 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 49 treesize of output 52 [2022-12-14 08:39:07,390 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 28 treesize of output 22 [2022-12-14 08:39:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-14 08:39:07,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758933963] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:39:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [638758927] [2022-12-14 08:39:07,607 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:39:07,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:39:07,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 44 [2022-12-14 08:39:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276234260] [2022-12-14 08:39:07,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:39:07,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-14 08:39:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:39:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-14 08:39:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1764, Unknown=2, NotChecked=170, Total=2070 [2022-12-14 08:39:07,609 INFO L87 Difference]: Start difference. First operand 1597 states and 3437 transitions. Second operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:39:25,185 INFO L93 Difference]: Finished difference Result 2925 states and 6042 transitions. [2022-12-14 08:39:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-14 08:39:25,185 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 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 28 [2022-12-14 08:39:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:39:25,192 INFO L225 Difference]: With dead ends: 2925 [2022-12-14 08:39:25,192 INFO L226 Difference]: Without dead ends: 2925 [2022-12-14 08:39:25,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 34 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2188 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=1139, Invalid=8373, Unknown=2, NotChecked=386, Total=9900 [2022-12-14 08:39:25,197 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1071 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5539 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 5539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-12-14 08:39:25,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 0 Invalid, 5863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 5539 Invalid, 0 Unknown, 270 Unchecked, 3.7s Time] [2022-12-14 08:39:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2022-12-14 08:39:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1788. [2022-12-14 08:39:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1783 states have (on average 2.1245092540661807) internal successors, (3788), 1787 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 3788 transitions. [2022-12-14 08:39:25,226 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 3788 transitions. Word has length 28 [2022-12-14 08:39:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:39:25,226 INFO L495 AbstractCegarLoop]: Abstraction has 1788 states and 3788 transitions. [2022-12-14 08:39:25,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 3788 transitions. [2022-12-14 08:39:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 08:39:25,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:39:25,227 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:39:25,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 08:39:25,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 08:39:25,428 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:39:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:39:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash 457344967, now seen corresponding path program 2 times [2022-12-14 08:39:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:39:25,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760286546] [2022-12-14 08:39:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:39:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:39:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:39:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 08:39:25,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:39:25,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760286546] [2022-12-14 08:39:25,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760286546] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:39:25,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531774929] [2022-12-14 08:39:25,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:39:25,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:39:25,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:39:25,469 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:39:25,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 08:39:25,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 08:39:25,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:39:25,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 08:39:25,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:39:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 08:39:25,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:39:25,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531774929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:39:25,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:39:25,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2022-12-14 08:39:25,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888666236] [2022-12-14 08:39:25,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:39:25,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:39:25,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:39:25,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:39:25,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:39:25,748 INFO L87 Difference]: Start difference. First operand 1788 states and 3788 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:39:25,797 INFO L93 Difference]: Finished difference Result 1787 states and 3787 transitions. [2022-12-14 08:39:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:39:25,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 32 [2022-12-14 08:39:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:39:25,800 INFO L225 Difference]: With dead ends: 1787 [2022-12-14 08:39:25,801 INFO L226 Difference]: Without dead ends: 1604 [2022-12-14 08:39:25,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:39:25,801 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:39:25,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:39:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2022-12-14 08:39:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1268. [2022-12-14 08:39:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1264 states have (on average 2.1447784810126582) internal successors, (2711), 1267 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2711 transitions. [2022-12-14 08:39:25,819 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2711 transitions. Word has length 32 [2022-12-14 08:39:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:39:25,819 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 2711 transitions. [2022-12-14 08:39:25,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2711 transitions. [2022-12-14 08:39:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 08:39:25,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:39:25,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:39:25,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 08:39:26,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 08:39:26,022 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:39:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:39:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1487175756, now seen corresponding path program 1 times [2022-12-14 08:39:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:39:26,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055132837] [2022-12-14 08:39:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:39:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:39:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:39:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:39:26,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:39:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055132837] [2022-12-14 08:39:26,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055132837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:39:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459240059] [2022-12-14 08:39:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:39:26,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:39:26,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:39:26,397 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:39:26,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 08:39:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:39:26,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 08:39:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:39:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:39:26,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:39:27,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:39:27,375 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 36 treesize of output 40 [2022-12-14 08:39:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:39:27,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459240059] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:39:27,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1192053511] [2022-12-14 08:39:27,532 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:39:27,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:39:27,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 41 [2022-12-14 08:39:27,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833511779] [2022-12-14 08:39:27,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:39:27,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 08:39:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:39:27,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 08:39:27,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 08:39:27,534 INFO L87 Difference]: Start difference. First operand 1268 states and 2711 transitions. Second operand has 43 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 42 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:39:29,974 INFO L93 Difference]: Finished difference Result 1572 states and 3288 transitions. [2022-12-14 08:39:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 08:39:29,975 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 42 states have internal predecessors, (96), 0 states have call successors, (0), 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 34 [2022-12-14 08:39:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:39:29,977 INFO L225 Difference]: With dead ends: 1572 [2022-12-14 08:39:29,977 INFO L226 Difference]: Without dead ends: 1572 [2022-12-14 08:39:29,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=917, Invalid=3775, Unknown=0, NotChecked=0, Total=4692 [2022-12-14 08:39:29,978 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 504 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:39:29,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 0 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 08:39:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-12-14 08:39:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1262. [2022-12-14 08:39:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1259 states have (on average 2.1405877680698966) internal successors, (2695), 1261 states have internal predecessors, (2695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2695 transitions. [2022-12-14 08:39:29,993 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2695 transitions. Word has length 34 [2022-12-14 08:39:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:39:29,993 INFO L495 AbstractCegarLoop]: Abstraction has 1262 states and 2695 transitions. [2022-12-14 08:39:29,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.2857142857142856) internal successors, (96), 42 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2695 transitions. [2022-12-14 08:39:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 08:39:29,994 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:39:29,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:39:29,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 08:39:30,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:39:30,195 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:39:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:39:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1048229723, now seen corresponding path program 1 times [2022-12-14 08:39:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:39:30,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930718932] [2022-12-14 08:39:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:39:30,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:39:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:39:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:39:30,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:39:30,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930718932] [2022-12-14 08:39:30,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930718932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:39:30,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080790489] [2022-12-14 08:39:30,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:39:30,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:39:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:39:30,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:39:30,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 08:39:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:39:31,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-14 08:39:31,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:39:31,422 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 22 treesize of output 17 [2022-12-14 08:39:31,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:39:31,836 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 38 [2022-12-14 08:39:32,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 08:39:32,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 46 [2022-12-14 08:39:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:39:33,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:39:34,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 57 treesize of output 48 [2022-12-14 08:39:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:39:35,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080790489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:39:35,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922852280] [2022-12-14 08:39:35,342 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:39:35,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:39:35,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 61 [2022-12-14 08:39:35,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847529806] [2022-12-14 08:39:35,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:39:35,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-14 08:39:35,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:39:35,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-14 08:39:35,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=3497, Unknown=0, NotChecked=0, Total=3906 [2022-12-14 08:39:35,346 INFO L87 Difference]: Start difference. First operand 1262 states and 2695 transitions. Second operand has 63 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:48,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 08:39:52,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 08:39:56,209 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-12-14 08:39:58,293 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-12-14 08:39:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:39:58,638 INFO L93 Difference]: Finished difference Result 2908 states and 6045 transitions. [2022-12-14 08:39:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-14 08:39:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 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 36 [2022-12-14 08:39:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:39:58,642 INFO L225 Difference]: With dead ends: 2908 [2022-12-14 08:39:58,642 INFO L226 Difference]: Without dead ends: 2691 [2022-12-14 08:39:58,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4702 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1769, Invalid=12993, Unknown=0, NotChecked=0, Total=14762 [2022-12-14 08:39:58,644 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 622 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-12-14 08:39:58,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 0 Invalid, 5240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 5193 Invalid, 3 Unknown, 0 Unchecked, 13.7s Time] [2022-12-14 08:39:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2022-12-14 08:39:58,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 1955. [2022-12-14 08:39:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1952 states have (on average 2.0522540983606556) internal successors, (4006), 1954 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 4006 transitions. [2022-12-14 08:39:58,666 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 4006 transitions. Word has length 36 [2022-12-14 08:39:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:39:58,666 INFO L495 AbstractCegarLoop]: Abstraction has 1955 states and 4006 transitions. [2022-12-14 08:39:58,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:39:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 4006 transitions. [2022-12-14 08:39:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 08:39:58,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:39:58,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:39:58,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 08:39:58,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:39:58,869 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:39:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:39:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1264058641, now seen corresponding path program 2 times [2022-12-14 08:39:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:39:58,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777345328] [2022-12-14 08:39:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:39:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:39:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:40:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:40:00,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:40:00,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777345328] [2022-12-14 08:40:00,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777345328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:40:00,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424755212] [2022-12-14 08:40:00,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:40:00,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:40:00,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:40:00,027 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:40:00,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 08:40:00,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 08:40:00,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:40:00,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 83 conjunts are in the unsatisfiable core [2022-12-14 08:40:00,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:40:00,189 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-14 08:40:00,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-14 08:40:00,480 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 22 treesize of output 17 [2022-12-14 08:40:00,626 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 59 treesize of output 54 [2022-12-14 08:40:01,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:40:01,030 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 72 treesize of output 43 [2022-12-14 08:40:01,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 111 treesize of output 46 [2022-12-14 08:40:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:40:02,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:40:04,198 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_974 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_974) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-14 08:40:04,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:40:04,205 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-12-14 08:40:04,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:40:04,214 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 49 treesize of output 52 [2022-12-14 08:40:04,218 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 28 treesize of output 22 [2022-12-14 08:40:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 08:40:04,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424755212] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:40:04,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472722679] [2022-12-14 08:40:04,533 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:40:04,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:40:04,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 62 [2022-12-14 08:40:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069884822] [2022-12-14 08:40:04,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:40:04,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-14 08:40:04,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:40:04,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-14 08:40:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3713, Unknown=13, NotChecked=122, Total=4032 [2022-12-14 08:40:04,537 INFO L87 Difference]: Start difference. First operand 1955 states and 4006 transitions. Second operand has 64 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 63 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:40:08,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:40:10,584 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] [2022-12-14 08:40:11,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:40:14,224 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] [2022-12-14 08:40:17,410 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] [2022-12-14 08:40:18,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:40:20,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:40:22,719 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] [2022-12-14 08:40:24,763 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] [2022-12-14 08:40:26,809 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] [2022-12-14 08:40:28,849 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] [2022-12-14 08:40:30,915 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] [2022-12-14 08:40:32,969 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] [2022-12-14 08:40:35,254 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] [2022-12-14 08:40:38,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:40:41,095 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-12-14 08:40:43,710 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] [2022-12-14 08:40:46,701 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] [2022-12-14 08:40:49,416 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] [2022-12-14 08:40:52,186 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] [2022-12-14 08:40:54,292 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] [2022-12-14 08:40:55,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:40:57,520 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] [2022-12-14 08:41:01,021 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] [2022-12-14 08:41:03,070 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] [2022-12-14 08:41:05,134 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] [2022-12-14 08:41:07,193 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] [2022-12-14 08:41:09,258 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] [2022-12-14 08:41:11,299 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] [2022-12-14 08:41:13,350 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] [2022-12-14 08:41:15,390 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] [2022-12-14 08:41:17,643 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] [2022-12-14 08:41:19,695 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] [2022-12-14 08:41:22,646 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] [2022-12-14 08:41:24,665 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] [2022-12-14 08:41:26,685 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] [2022-12-14 08:41:31,456 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] [2022-12-14 08:41:33,794 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] [2022-12-14 08:41:35,874 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] [2022-12-14 08:41:37,922 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] [2022-12-14 08:41:39,992 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] [2022-12-14 08:41:42,666 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] [2022-12-14 08:41:44,706 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] [2022-12-14 08:41:46,780 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] [2022-12-14 08:41:48,826 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] [2022-12-14 08:41:50,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:41:53,368 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] [2022-12-14 08:41:55,426 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-12-14 08:41:58,072 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-12-14 08:42:00,238 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] [2022-12-14 08:42:03,401 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] [2022-12-14 08:42:05,960 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] [2022-12-14 08:42:08,034 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] [2022-12-14 08:42:10,672 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-12-14 08:42:13,130 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] [2022-12-14 08:42:15,244 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] [2022-12-14 08:42:17,342 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] [2022-12-14 08:42:20,003 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] [2022-12-14 08:42:22,049 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] [2022-12-14 08:42:24,093 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] [2022-12-14 08:42:26,660 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] [2022-12-14 08:42:28,703 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] [2022-12-14 08:42:30,939 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] [2022-12-14 08:42:33,755 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-12-14 08:42:35,830 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-12-14 08:42:37,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 [0] [2022-12-14 08:42:39,977 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] [2022-12-14 08:42:42,641 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] [2022-12-14 08:42:44,743 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] [2022-12-14 08:42:47,289 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] [2022-12-14 08:42:49,707 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] [2022-12-14 08:42:51,819 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] [2022-12-14 08:42:53,880 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] [2022-12-14 08:42:56,494 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] [2022-12-14 08:42:58,531 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] [2022-12-14 08:43:00,773 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] [2022-12-14 08:43:04,144 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] [2022-12-14 08:43:06,192 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] [2022-12-14 08:43:08,617 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] [2022-12-14 08:43:10,663 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] [2022-12-14 08:43:12,931 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] [2022-12-14 08:43:19,621 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] [2022-12-14 08:43:21,709 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] [2022-12-14 08:43:24,097 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] [2022-12-14 08:43:26,118 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] [2022-12-14 08:43:28,186 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] [2022-12-14 08:43:30,287 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] [2022-12-14 08:43:32,352 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] [2022-12-14 08:43:34,423 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] [2022-12-14 08:43:37,046 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] [2022-12-14 08:43:39,083 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] [2022-12-14 08:43:41,311 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] [2022-12-14 08:43:43,379 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] [2022-12-14 08:43:45,441 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] [2022-12-14 08:43:47,868 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] [2022-12-14 08:43:49,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 [0] [2022-12-14 08:43:51,969 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] [2022-12-14 08:43:54,913 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] [2022-12-14 08:43:56,959 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] [2022-12-14 08:43:59,541 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] [2022-12-14 08:44:01,906 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] [2022-12-14 08:44:04,326 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] [2022-12-14 08:44:07,271 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] [2022-12-14 08:44:12,290 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] [2022-12-14 08:44:15,414 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] [2022-12-14 08:44:18,392 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] [2022-12-14 08:44:20,423 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] [2022-12-14 08:44:23,397 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] [2022-12-14 08:44:25,449 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] [2022-12-14 08:44:28,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:44:30,955 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] [2022-12-14 08:44:33,000 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] [2022-12-14 08:44:35,070 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] [2022-12-14 08:44:37,886 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] [2022-12-14 08:44:40,284 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] [2022-12-14 08:44:42,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:44:44,460 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] [2022-12-14 08:44:46,480 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] [2022-12-14 08:44:49,356 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] [2022-12-14 08:44:51,405 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-12-14 08:44:53,998 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-12-14 08:44:58,478 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] [2022-12-14 08:45:00,523 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] [2022-12-14 08:45:02,821 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] [2022-12-14 08:45:04,892 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] [2022-12-14 08:45:10,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:45:12,843 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] [2022-12-14 08:45:14,888 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] [2022-12-14 08:45:18,003 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] [2022-12-14 08:45:20,059 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-12-14 08:45:22,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:45:24,637 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] [2022-12-14 08:45:26,654 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] [2022-12-14 08:45:28,674 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] [2022-12-14 08:45:30,708 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] [2022-12-14 08:45:32,763 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] [2022-12-14 08:45:34,808 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] [2022-12-14 08:45:36,868 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] [2022-12-14 08:45:38,922 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] [2022-12-14 08:45:40,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:45:42,866 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-12-14 08:45:44,950 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] [2022-12-14 08:45:47,003 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] [2022-12-14 08:45:48,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:45:50,150 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] [2022-12-14 08:45:52,931 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] [2022-12-14 08:45:54,962 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] [2022-12-14 08:45:57,146 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] [2022-12-14 08:45:59,193 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] [2022-12-14 08:46:01,229 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] [2022-12-14 08:46:03,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:46:05,387 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] [2022-12-14 08:46:07,438 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] [2022-12-14 08:46:10,173 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] [2022-12-14 08:46:12,240 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] [2022-12-14 08:46:14,400 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] [2022-12-14 08:46:16,438 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] [2022-12-14 08:46:19,491 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] [2022-12-14 08:46:21,534 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] [2022-12-14 08:46:26,924 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] [2022-12-14 08:46:29,001 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] [2022-12-14 08:46:32,586 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] [2022-12-14 08:46:34,713 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] [2022-12-14 08:46:36,780 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] [2022-12-14 08:46:38,816 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] [2022-12-14 08:46:40,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:46:42,652 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] [2022-12-14 08:46:45,485 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] [2022-12-14 08:46:47,500 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] [2022-12-14 08:46:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:46:49,387 INFO L93 Difference]: Finished difference Result 5545 states and 11180 transitions. [2022-12-14 08:46:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-12-14 08:46:49,387 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 63 states have internal predecessors, (108), 0 states have call successors, (0), 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 36 [2022-12-14 08:46:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:46:49,394 INFO L225 Difference]: With dead ends: 5545 [2022-12-14 08:46:49,394 INFO L226 Difference]: Without dead ends: 5449 [2022-12-14 08:46:49,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 182 ConstructedPredicates, 1 IntricatePredicates, 14 DeprecatedPredicates, 9104 ImplicationChecksByTransitivity, 52.6s TimeCoverageRelationStatistics Valid=3248, Invalid=30048, Unknown=14, NotChecked=362, Total=33672 [2022-12-14 08:46:49,396 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2251 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7641 mSolverCounterSat, 132 mSolverCounterUnsat, 216 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 353.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 7641 IncrementalHoareTripleChecker+Invalid, 216 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 356.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:46:49,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2251 Valid, 0 Invalid, 8342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 7641 Invalid, 216 Unknown, 353 Unchecked, 356.2s Time] [2022-12-14 08:46:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-12-14 08:46:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 2747. [2022-12-14 08:46:49,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2747 states, 2744 states have (on average 2.1567055393586005) internal successors, (5918), 2746 states have internal predecessors, (5918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:46:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 5918 transitions. [2022-12-14 08:46:49,446 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 5918 transitions. Word has length 36 [2022-12-14 08:46:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:46:49,446 INFO L495 AbstractCegarLoop]: Abstraction has 2747 states and 5918 transitions. [2022-12-14 08:46:49,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.7142857142857142) internal successors, (108), 63 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:46:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 5918 transitions. [2022-12-14 08:46:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 08:46:49,449 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:46:49,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:46:49,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 08:46:49,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:46:49,650 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:46:49,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:46:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash -531111620, now seen corresponding path program 1 times [2022-12-14 08:46:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:46:49,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847226265] [2022-12-14 08:46:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:46:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:46:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:46:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:46:51,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:46:51,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847226265] [2022-12-14 08:46:51,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847226265] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:46:51,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137779769] [2022-12-14 08:46:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:46:51,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:46:51,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:46:51,113 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:46:51,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 08:46:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:46:51,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 84 conjunts are in the unsatisfiable core [2022-12-14 08:46:51,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:46:51,466 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 08:46:51,466 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 15 treesize of output 15 [2022-12-14 08:46:51,787 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 22 treesize of output 17 [2022-12-14 08:46:51,963 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 43 treesize of output 38 [2022-12-14 08:46:52,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:46:52,529 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 38 [2022-12-14 08:46:53,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 79 treesize of output 46 [2022-12-14 08:46:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:46:54,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:46:56,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1039) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294))) is different from false [2022-12-14 08:46:57,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:46:57,119 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-12-14 08:46:57,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:46:57,129 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 49 treesize of output 52 [2022-12-14 08:46:57,133 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 28 treesize of output 22 [2022-12-14 08:46:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:46:57,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137779769] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:46:57,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1823776578] [2022-12-14 08:46:57,504 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:46:57,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:46:57,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 62 [2022-12-14 08:46:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106228570] [2022-12-14 08:46:57,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:46:57,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-14 08:46:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:46:57,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-14 08:46:57,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3689, Unknown=8, NotChecked=122, Total=4032 [2022-12-14 08:46:57,506 INFO L87 Difference]: Start difference. First operand 2747 states and 5918 transitions. Second operand has 64 states, 63 states have (on average 1.7619047619047619) internal successors, (111), 63 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:47:46,232 INFO L93 Difference]: Finished difference Result 6534 states and 13240 transitions. [2022-12-14 08:47:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-12-14 08:47:46,233 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.7619047619047619) internal successors, (111), 63 states have internal predecessors, (111), 0 states have call successors, (0), 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 37 [2022-12-14 08:47:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:47:46,240 INFO L225 Difference]: With dead ends: 6534 [2022-12-14 08:47:46,241 INFO L226 Difference]: Without dead ends: 6340 [2022-12-14 08:47:46,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 8405 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=2314, Invalid=24332, Unknown=90, NotChecked=324, Total=27060 [2022-12-14 08:47:46,243 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1491 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10253 mSolverCounterSat, 131 mSolverCounterUnsat, 233 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 10253 IncrementalHoareTripleChecker+Invalid, 233 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-12-14 08:47:46,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 0 Invalid, 10850 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [131 Valid, 10253 Invalid, 233 Unknown, 233 Unchecked, 17.3s Time] [2022-12-14 08:47:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2022-12-14 08:47:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 2677. [2022-12-14 08:47:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2674 states have (on average 2.1738967838444276) internal successors, (5813), 2676 states have internal predecessors, (5813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 5813 transitions. [2022-12-14 08:47:46,294 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 5813 transitions. Word has length 37 [2022-12-14 08:47:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:47:46,294 INFO L495 AbstractCegarLoop]: Abstraction has 2677 states and 5813 transitions. [2022-12-14 08:47:46,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.7619047619047619) internal successors, (111), 63 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 5813 transitions. [2022-12-14 08:47:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 08:47:46,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:47:46,296 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:47:46,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 08:47:46,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 08:47:46,496 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:47:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:47:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -457143785, now seen corresponding path program 2 times [2022-12-14 08:47:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:47:46,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119149489] [2022-12-14 08:47:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:47:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:47:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:47:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:47:46,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:47:46,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119149489] [2022-12-14 08:47:46,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119149489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:47:46,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923128574] [2022-12-14 08:47:46,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:47:46,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:47:46,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:47:46,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:47:46,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 08:47:46,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 08:47:46,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:47:46,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 08:47:46,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:47:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 08:47:46,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:47:46,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923128574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:47:46,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:47:46,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2022-12-14 08:47:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100443908] [2022-12-14 08:47:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:47:46,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:47:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:47:46,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:47:46,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-12-14 08:47:46,898 INFO L87 Difference]: Start difference. First operand 2677 states and 5813 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:47:47,095 INFO L93 Difference]: Finished difference Result 3128 states and 6642 transitions. [2022-12-14 08:47:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:47:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 38 [2022-12-14 08:47:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:47:47,099 INFO L225 Difference]: With dead ends: 3128 [2022-12-14 08:47:47,099 INFO L226 Difference]: Without dead ends: 3128 [2022-12-14 08:47:47,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-12-14 08:47:47,099 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:47:47,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:47:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2022-12-14 08:47:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2738. [2022-12-14 08:47:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 2735 states have (on average 2.179524680073126) internal successors, (5961), 2737 states have internal predecessors, (5961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 5961 transitions. [2022-12-14 08:47:47,132 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 5961 transitions. Word has length 38 [2022-12-14 08:47:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:47:47,132 INFO L495 AbstractCegarLoop]: Abstraction has 2738 states and 5961 transitions. [2022-12-14 08:47:47,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 5961 transitions. [2022-12-14 08:47:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 08:47:47,133 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:47:47,134 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:47:47,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 08:47:47,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 08:47:47,334 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:47:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:47:47,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2099934151, now seen corresponding path program 3 times [2022-12-14 08:47:47,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:47:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872594011] [2022-12-14 08:47:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:47:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:47:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:47:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:47:47,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:47:47,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872594011] [2022-12-14 08:47:47,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872594011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:47:47,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327648591] [2022-12-14 08:47:47,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 08:47:47,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:47:47,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:47:47,506 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:47:47,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 08:47:47,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 08:47:47,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:47:47,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 08:47:47,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:47:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:47:47,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:47:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:47:47,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327648591] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:47:47,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [362058280] [2022-12-14 08:47:47,747 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:47:47,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:47:47,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-12-14 08:47:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844942286] [2022-12-14 08:47:47,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:47:47,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 08:47:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:47:47,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 08:47:47,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-12-14 08:47:47,749 INFO L87 Difference]: Start difference. First operand 2738 states and 5961 transitions. Second operand has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:47:48,464 INFO L93 Difference]: Finished difference Result 3750 states and 7712 transitions. [2022-12-14 08:47:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 08:47:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 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 39 [2022-12-14 08:47:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:47:48,468 INFO L225 Difference]: With dead ends: 3750 [2022-12-14 08:47:48,468 INFO L226 Difference]: Without dead ends: 3711 [2022-12-14 08:47:48,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=1040, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 08:47:48,468 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 08:47:48,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 08:47:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2022-12-14 08:47:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 2661. [2022-12-14 08:47:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2658 states have (on average 2.120015048908954) internal successors, (5635), 2660 states have internal predecessors, (5635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 5635 transitions. [2022-12-14 08:47:48,503 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 5635 transitions. Word has length 39 [2022-12-14 08:47:48,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:47:48,503 INFO L495 AbstractCegarLoop]: Abstraction has 2661 states and 5635 transitions. [2022-12-14 08:47:48,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.052631578947368) internal successors, (77), 19 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:48,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 5635 transitions. [2022-12-14 08:47:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 08:47:48,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:47:48,505 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-12-14 08:47:48,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 08:47:48,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:47:48,705 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:47:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:47:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1541578767, now seen corresponding path program 3 times [2022-12-14 08:47:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:47:48,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110512653] [2022-12-14 08:47:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:47:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:47:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:47:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 56 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:47:48,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:47:48,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110512653] [2022-12-14 08:47:48,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110512653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:47:48,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845735710] [2022-12-14 08:47:48,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 08:47:48,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:47:48,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:47:48,794 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:47:48,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 08:47:48,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 08:47:48,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:47:48,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 08:47:48,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:47:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:47:48,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 08:47:48,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845735710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:47:48,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 08:47:48,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2022-12-14 08:47:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473116603] [2022-12-14 08:47:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:47:48,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 08:47:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:47:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 08:47:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:47:48,982 INFO L87 Difference]: Start difference. First operand 2661 states and 5635 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:47:49,225 INFO L93 Difference]: Finished difference Result 4240 states and 8764 transitions. [2022-12-14 08:47:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:47:49,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-12-14 08:47:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:47:49,228 INFO L225 Difference]: With dead ends: 4240 [2022-12-14 08:47:49,229 INFO L226 Difference]: Without dead ends: 3228 [2022-12-14 08:47:49,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-12-14 08:47:49,229 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:47:49,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:47:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-12-14 08:47:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 1944. [2022-12-14 08:47:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1941 states have (on average 2.0808861411643482) internal successors, (4039), 1943 states have internal predecessors, (4039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 4039 transitions. [2022-12-14 08:47:49,260 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 4039 transitions. Word has length 41 [2022-12-14 08:47:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:47:49,260 INFO L495 AbstractCegarLoop]: Abstraction has 1944 states and 4039 transitions. [2022-12-14 08:47:49,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:47:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 4039 transitions. [2022-12-14 08:47:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 08:47:49,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:47:49,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:47:49,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 08:47:49,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 08:47:49,462 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:47:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:47:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -343099563, now seen corresponding path program 3 times [2022-12-14 08:47:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:47:49,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246261342] [2022-12-14 08:47:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:47:49,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:47:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:47:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:47:51,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:47:51,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246261342] [2022-12-14 08:47:51,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246261342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:47:51,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519831962] [2022-12-14 08:47:51,151 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 08:47:51,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:47:51,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:47:51,152 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:47:51,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 08:47:51,275 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 08:47:51,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:47:51,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-14 08:47:51,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:47:51,299 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-14 08:47:51,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-14 08:47:51,778 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 22 treesize of output 17 [2022-12-14 08:47:51,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-14 08:47:52,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:47:52,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2022-12-14 08:47:54,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 79 treesize of output 46 [2022-12-14 08:47:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:47:57,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:48:04,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:48:04,611 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-12-14 08:48:04,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:48:04,621 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 49 treesize of output 52 [2022-12-14 08:48:04,625 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 28 treesize of output 22 [2022-12-14 08:48:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:48:05,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519831962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:48:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1436714528] [2022-12-14 08:48:05,051 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:48:05,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:48:05,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 20] total 67 [2022-12-14 08:48:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040875471] [2022-12-14 08:48:05,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:48:05,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-14 08:48:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:48:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-14 08:48:05,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4442, Unknown=12, NotChecked=0, Total=4692 [2022-12-14 08:48:05,053 INFO L87 Difference]: Start difference. First operand 1944 states and 4039 transitions. Second operand has 69 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 68 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:49:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:49:13,089 INFO L93 Difference]: Finished difference Result 3158 states and 6347 transitions. [2022-12-14 08:49:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-12-14 08:49:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 68 states have internal predecessors, (129), 0 states have call successors, (0), 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 43 [2022-12-14 08:49:13,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:49:13,092 INFO L225 Difference]: With dead ends: 3158 [2022-12-14 08:49:13,092 INFO L226 Difference]: Without dead ends: 3096 [2022-12-14 08:49:13,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9943 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=2729, Invalid=28387, Unknown=36, NotChecked=0, Total=31152 [2022-12-14 08:49:13,094 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1340 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11531 mSolverCounterSat, 132 mSolverCounterUnsat, 243 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 11531 IncrementalHoareTripleChecker+Invalid, 243 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2022-12-14 08:49:13,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 0 Invalid, 11906 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [132 Valid, 11531 Invalid, 243 Unknown, 0 Unchecked, 19.8s Time] [2022-12-14 08:49:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2022-12-14 08:49:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 1471. [2022-12-14 08:49:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1468 states have (on average 2.0476839237057223) internal successors, (3006), 1470 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:49:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 3006 transitions. [2022-12-14 08:49:13,112 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 3006 transitions. Word has length 43 [2022-12-14 08:49:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:49:13,112 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 3006 transitions. [2022-12-14 08:49:13,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 68 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:49:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 3006 transitions. [2022-12-14 08:49:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 08:49:13,113 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:49:13,113 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:49:13,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 08:49:13,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 08:49:13,314 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:49:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:49:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -860677549, now seen corresponding path program 4 times [2022-12-14 08:49:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:49:13,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565970000] [2022-12-14 08:49:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:49:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:49:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:49:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 08:49:13,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:49:13,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565970000] [2022-12-14 08:49:13,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565970000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:49:13,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544279459] [2022-12-14 08:49:13,586 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 08:49:13,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:49:13,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:49:13,587 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:49:13,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 08:49:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:49:13,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 08:49:13,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:49:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 08:49:13,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:49:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 08:49:13,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544279459] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:49:13,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50804179] [2022-12-14 08:49:13,898 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:49:13,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:49:13,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 17 [2022-12-14 08:49:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252866322] [2022-12-14 08:49:13,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:49:13,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 08:49:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:49:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 08:49:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-12-14 08:49:13,900 INFO L87 Difference]: Start difference. First operand 1471 states and 3006 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:49:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:49:14,468 INFO L93 Difference]: Finished difference Result 1771 states and 3531 transitions. [2022-12-14 08:49:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 08:49:14,468 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 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 45 [2022-12-14 08:49:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:49:14,470 INFO L225 Difference]: With dead ends: 1771 [2022-12-14 08:49:14,470 INFO L226 Difference]: Without dead ends: 1345 [2022-12-14 08:49:14,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-12-14 08:49:14,470 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 08:49:14,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 08:49:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-12-14 08:49:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 896. [2022-12-14 08:49:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 893 states have (on average 2.139977603583427) internal successors, (1911), 895 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:49:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1911 transitions. [2022-12-14 08:49:14,479 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1911 transitions. Word has length 45 [2022-12-14 08:49:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:49:14,479 INFO L495 AbstractCegarLoop]: Abstraction has 896 states and 1911 transitions. [2022-12-14 08:49:14,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:49:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1911 transitions. [2022-12-14 08:49:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 08:49:14,480 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:49:14,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:49:14,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 08:49:14,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 08:49:14,682 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:49:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:49:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1341209595, now seen corresponding path program 4 times [2022-12-14 08:49:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:49:14,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025272085] [2022-12-14 08:49:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:49:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:49:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:49:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:49:16,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:49:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025272085] [2022-12-14 08:49:16,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025272085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:49:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061459729] [2022-12-14 08:49:16,835 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 08:49:16,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:49:16,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:49:16,836 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:49:16,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 08:49:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:49:16,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-14 08:49:16,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:49:17,323 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 22 treesize of output 17 [2022-12-14 08:49:17,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:49:17,930 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 72 treesize of output 43 [2022-12-14 08:49:18,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:49:18,623 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 72 treesize of output 43 [2022-12-14 08:49:19,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 111 treesize of output 46 [2022-12-14 08:49:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:49:27,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:49:33,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 54 treesize of output 46 [2022-12-14 08:49:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:49:33,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061459729] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:49:33,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1805493169] [2022-12-14 08:49:33,813 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:49:33,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:49:33,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 25] total 79 [2022-12-14 08:49:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711771290] [2022-12-14 08:49:33,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:49:33,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-12-14 08:49:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:49:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-12-14 08:49:33,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=6026, Unknown=3, NotChecked=0, Total=6320 [2022-12-14 08:49:33,815 INFO L87 Difference]: Start difference. First operand 896 states and 1911 transitions. Second operand has 80 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 80 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:51:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:51:14,172 INFO L93 Difference]: Finished difference Result 3190 states and 6524 transitions. [2022-12-14 08:51:14,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2022-12-14 08:51:14,173 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 80 states have internal predecessors, (153), 0 states have call successors, (0), 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 51 [2022-12-14 08:51:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:51:14,175 INFO L225 Difference]: With dead ends: 3190 [2022-12-14 08:51:14,175 INFO L226 Difference]: Without dead ends: 2523 [2022-12-14 08:51:14,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13409 ImplicationChecksByTransitivity, 98.0s TimeCoverageRelationStatistics Valid=4474, Invalid=41533, Unknown=3, NotChecked=0, Total=46010 [2022-12-14 08:51:14,178 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1390 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12810 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 12810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-12-14 08:51:14,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 0 Invalid, 12933 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [123 Valid, 12810 Invalid, 0 Unknown, 0 Unchecked, 18.7s Time] [2022-12-14 08:51:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2022-12-14 08:51:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 1617. [2022-12-14 08:51:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1614 states have (on average 2.066914498141264) internal successors, (3336), 1616 states have internal predecessors, (3336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:51:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 3336 transitions. [2022-12-14 08:51:14,196 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 3336 transitions. Word has length 51 [2022-12-14 08:51:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:51:14,196 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 3336 transitions. [2022-12-14 08:51:14,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 80 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:51:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 3336 transitions. [2022-12-14 08:51:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 08:51:14,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:51:14,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:51:14,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-14 08:51:14,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 08:51:14,398 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-12-14 08:51:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:51:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1131188101, now seen corresponding path program 5 times [2022-12-14 08:51:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:51:14,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884231900] [2022-12-14 08:51:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:51:14,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:51:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:51:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:51:16,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:51:16,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884231900] [2022-12-14 08:51:16,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884231900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 08:51:16,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139857482] [2022-12-14 08:51:16,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 08:51:16,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 08:51:16,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:51:16,618 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 08:51:16,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a38b10c0-dc49-4110-86d7-f7c3f823fb19/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 08:51:16,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 08:51:16,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 08:51:16,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 107 conjunts are in the unsatisfiable core [2022-12-14 08:51:16,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 08:51:16,849 INFO L321 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2022-12-14 08:51:16,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 56 [2022-12-14 08:51:17,381 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 22 treesize of output 17 [2022-12-14 08:51:17,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-14 08:51:18,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:51:18,273 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 72 treesize of output 43 [2022-12-14 08:51:18,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 08:51:18,940 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 72 treesize of output 43 [2022-12-14 08:51:20,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 111 treesize of output 46 [2022-12-14 08:51:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:51:31,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 08:51:38,464 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1583 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1583) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296) 4294967294))) is different from false [2022-12-14 08:51:38,470 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1583 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1583) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-14 08:51:38,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:51:38,477 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-12-14 08:51:38,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 08:51:38,488 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 49 treesize of output 52 [2022-12-14 08:51:38,491 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 28 treesize of output 22 [2022-12-14 08:51:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 08:51:38,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139857482] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 08:51:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1909390876] [2022-12-14 08:51:38,979 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 08:51:38,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 08:51:38,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 82 [2022-12-14 08:51:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247272383] [2022-12-14 08:51:38,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 08:51:38,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-12-14 08:51:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:51:38,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-12-14 08:51:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=6393, Unknown=6, NotChecked=322, Total=6972 [2022-12-14 08:51:38,980 INFO L87 Difference]: Start difference. First operand 1617 states and 3336 transitions. Second operand has 84 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 83 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 08:51:45,291 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] [2022-12-14 08:51:49,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:51:51,702 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] [2022-12-14 08:51:53,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 08:51:56,219 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] [2022-12-14 08:51:58,271 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] [2022-12-14 08:52:01,213 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] [2022-12-14 08:52:03,601 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] [2022-12-14 08:52:05,664 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] [2022-12-14 08:52:08,553 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] [2022-12-14 08:52:11,511 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] [2022-12-14 08:52:14,001 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] [2022-12-14 08:52:16,058 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] [2022-12-14 08:52:18,113 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] [2022-12-14 08:52:20,200 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] [2022-12-14 08:52:22,572 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] [2022-12-14 08:52:25,168 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] [2022-12-14 08:52:27,684 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] [2022-12-14 08:52:29,756 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] [2022-12-14 08:52:32,533 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] [2022-12-14 08:52:34,632 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] [2022-12-14 08:52:36,712 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] [2022-12-14 08:52:38,809 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] [2022-12-14 08:52:41,450 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] [2022-12-14 08:52:43,546 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] [2022-12-14 08:52:46,459 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] [2022-12-14 08:52:49,277 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] [2022-12-14 08:52:51,353 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] [2022-12-14 08:52:53,419 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] [2022-12-14 08:52:55,924 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] [2022-12-14 08:52:57,984 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] [2022-12-14 08:53:01,063 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] [2022-12-14 08:53:03,136 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] [2022-12-14 08:53:05,215 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] [2022-12-14 08:53:08,439 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] [2022-12-14 08:53:11,195 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]