./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/stack_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/stack_longer-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW --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 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 --- 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-4e7fbc6 [2022-11-23 14:23:56,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:23:56,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:23:56,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:23:56,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:23:56,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:23:56,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:23:56,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:23:56,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:23:56,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:23:56,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:23:56,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:23:56,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:23:56,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:23:56,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:23:56,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:23:56,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:23:56,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:23:56,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:23:56,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:23:56,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:23:56,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:23:56,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:23:56,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:23:56,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:23:56,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:23:56,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:23:56,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:23:56,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:23:56,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:23:56,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:23:56,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:23:56,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:23:56,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:23:56,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:23:56,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:23:56,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:23:56,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:23:56,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:23:56,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:23:56,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:23:56,542 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:23:56,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:23:56,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:23:56,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:23:56,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:23:56,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:23:56,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:23:56,588 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:23:56,588 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:23:56,588 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:23:56,589 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:23:56,590 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:23:56,590 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:23:56,590 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:23:56,591 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:23:56,591 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:23:56,591 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:23:56,591 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:23:56,592 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:23:56,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:23:56,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:23:56,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:23:56,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:23:56,594 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:23:56,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:23:56,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:23:56,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:23:56,595 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:23:56,595 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:23:56,595 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:23:56,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:23:56,596 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:23:56,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:23:56,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:23:56,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:23:56,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:23:56,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:23:56,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:23:56,598 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:23:56,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:23:56,599 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:23:56,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:23:56,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:23:56,600 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_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/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_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW 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 -> 402cb3c5f3290109e83e598d96446a87fac59fa4aaa0b6234366e7da005f5688 [2022-11-23 14:23:56,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:23:56,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:23:56,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:23:56,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:23:56,910 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:23:56,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread/stack_longer-2.i [2022-11-23 14:24:00,106 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:24:00,431 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:24:00,432 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/sv-benchmarks/c/pthread/stack_longer-2.i [2022-11-23 14:24:00,448 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/data/e31780214/91a2ee403d2f4e83b55f8c95ddd227dd/FLAGceb4370cb [2022-11-23 14:24:00,465 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/data/e31780214/91a2ee403d2f4e83b55f8c95ddd227dd [2022-11-23 14:24:00,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:24:00,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:24:00,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:24:00,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:24:00,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:24:00,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:00" (1/1) ... [2022-11-23 14:24:00,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a416ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:00, skipping insertion in model container [2022-11-23 14:24:00,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:24:00" (1/1) ... [2022-11-23 14:24:00,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:24:00,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:24:01,081 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_d0096bda-411b-4cc4-aa0f-e0a2daac6157/sv-benchmarks/c/pthread/stack_longer-2.i[41529,41542] [2022-11-23 14:24:01,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:24:01,123 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:24:01,161 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_d0096bda-411b-4cc4-aa0f-e0a2daac6157/sv-benchmarks/c/pthread/stack_longer-2.i[41529,41542] [2022-11-23 14:24:01,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:24:01,271 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:24:01,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01 WrapperNode [2022-11-23 14:24:01,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:24:01,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:24:01,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:24:01,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:24:01,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,371 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-11-23 14:24:01,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:24:01,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:24:01,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:24:01,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:24:01,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,432 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:24:01,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:24:01,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:24:01,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:24:01,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (1/1) ... [2022-11-23 14:24:01,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:24:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:01,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:24:01,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:24:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-23 14:24:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-23 14:24:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-23 14:24:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-23 14:24:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:24:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:24:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:24:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:24:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 14:24:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:24:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:24:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:24:01,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:24:01,541 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 14:24:01,734 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:24:01,736 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:24:02,093 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:24:02,101 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:24:02,102 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 14:24:02,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:02 BoogieIcfgContainer [2022-11-23 14:24:02,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:24:02,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:24:02,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:24:02,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:24:02,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:24:00" (1/3) ... [2022-11-23 14:24:02,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f2f7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:24:02, skipping insertion in model container [2022-11-23 14:24:02,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:24:01" (2/3) ... [2022-11-23 14:24:02,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f2f7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:24:02, skipping insertion in model container [2022-11-23 14:24:02,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:24:02" (3/3) ... [2022-11-23 14:24:02,114 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-11-23 14:24:02,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:24:02,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-23 14:24:02,134 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 14:24:02,265 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 14:24:02,336 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:24:02,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 186 transitions, 388 flow [2022-11-23 14:24:02,351 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 186 transitions, 388 flow [2022-11-23 14:24:02,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 186 transitions, 388 flow [2022-11-23 14:24:02,464 INFO L130 PetriNetUnfolder]: 10/184 cut-off events. [2022-11-23 14:24:02,468 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 14:24:02,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 184 events. 10/184 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 488 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 134. Up to 3 conditions per place. [2022-11-23 14:24:02,490 INFO L119 LiptonReduction]: Number of co-enabled transitions 9804 [2022-11-23 14:24:08,749 INFO L134 LiptonReduction]: Checked pairs total: 15485 [2022-11-23 14:24:08,750 INFO L136 LiptonReduction]: Total number of compositions: 189 [2022-11-23 14:24:08,764 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 49 transitions, 114 flow [2022-11-23 14:24:08,854 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-11-23 14:24:08,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:24:08,894 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;@76c461e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:24:08,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-23 14:24:08,899 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-11-23 14:24:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 14:24:08,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:08,906 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 14:24:08,922 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-11-23 14:24:08,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:08,933 INFO L85 PathProgramCache]: Analyzing trace with hash 763, now seen corresponding path program 1 times [2022-11-23 14:24:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:08,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754899066] [2022-11-23 14:24:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:09,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:09,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754899066] [2022-11-23 14:24:09,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754899066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:09,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:09,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 14:24:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503255025] [2022-11-23 14:24:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:09,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 14:24:09,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 14:24:09,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 14:24:09,135 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-11-23 14:24:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:09,232 INFO L93 Difference]: Finished difference Result 780 states and 2224 transitions. [2022-11-23 14:24:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 14:24:09,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-23 14:24:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:09,252 INFO L225 Difference]: With dead ends: 780 [2022-11-23 14:24:09,252 INFO L226 Difference]: Without dead ends: 780 [2022-11-23 14:24:09,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 14:24:09,256 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:09,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-23 14:24:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2022-11-23 14:24:09,334 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-11-23 14:24:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2224 transitions. [2022-11-23 14:24:09,345 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2224 transitions. Word has length 1 [2022-11-23 14:24:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:09,346 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 2224 transitions. [2022-11-23 14:24:09,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2224 transitions. [2022-11-23 14:24:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:24:09,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:09,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:24:09,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:24:09,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 749726, now seen corresponding path program 1 times [2022-11-23 14:24:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:09,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996565087] [2022-11-23 14:24:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:09,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996565087] [2022-11-23 14:24:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996565087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:09,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:09,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:24:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920225617] [2022-11-23 14:24:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:09,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:09,636 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-11-23 14:24:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:09,712 INFO L93 Difference]: Finished difference Result 754 states and 2169 transitions. [2022-11-23 14:24:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:24:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:09,721 INFO L225 Difference]: With dead ends: 754 [2022-11-23 14:24:09,721 INFO L226 Difference]: Without dead ends: 754 [2022-11-23 14:24:09,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:09,724 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:09,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-23 14:24:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2022-11-23 14:24:09,768 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-11-23 14:24:09,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2169 transitions. [2022-11-23 14:24:09,772 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 2169 transitions. Word has length 3 [2022-11-23 14:24:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:09,772 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 2169 transitions. [2022-11-23 14:24:09,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:09,773 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 2169 transitions. [2022-11-23 14:24:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:24:09,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:09,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:24:09,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:24:09,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:09,775 INFO L85 PathProgramCache]: Analyzing trace with hash 749724, now seen corresponding path program 1 times [2022-11-23 14:24:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:09,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425014041] [2022-11-23 14:24:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:09,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:09,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425014041] [2022-11-23 14:24:09,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425014041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:09,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:09,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:24:09,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692800208] [2022-11-23 14:24:09,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:09,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:09,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:09,887 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-11-23 14:24:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:09,955 INFO L93 Difference]: Finished difference Result 728 states and 2114 transitions. [2022-11-23 14:24:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:24:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:09,961 INFO L225 Difference]: With dead ends: 728 [2022-11-23 14:24:09,962 INFO L226 Difference]: Without dead ends: 728 [2022-11-23 14:24:09,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-11-23 14:24:09,963 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:09,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-23 14:24:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2022-11-23 14:24:09,985 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-11-23 14:24:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2114 transitions. [2022-11-23 14:24:09,990 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2114 transitions. Word has length 3 [2022-11-23 14:24:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:09,991 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 2114 transitions. [2022-11-23 14:24:09,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:09,992 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2114 transitions. [2022-11-23 14:24:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:24:09,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:09,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:24:09,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:24:09,993 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-11-23 14:24:09,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:09,994 INFO L85 PathProgramCache]: Analyzing trace with hash 720503190, now seen corresponding path program 1 times [2022-11-23 14:24:09,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:09,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718252611] [2022-11-23 14:24:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:09,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:10,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:10,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718252611] [2022-11-23 14:24:10,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718252611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:10,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:10,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:24:10,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172373859] [2022-11-23 14:24:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:10,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:24:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:24:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:24:10,163 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-11-23 14:24:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:10,239 INFO L93 Difference]: Finished difference Result 560 states and 1572 transitions. [2022-11-23 14:24:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 14:24:10,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:10,244 INFO L225 Difference]: With dead ends: 560 [2022-11-23 14:24:10,244 INFO L226 Difference]: Without dead ends: 560 [2022-11-23 14:24:10,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:24:10,248 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:10,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-23 14:24:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2022-11-23 14:24:10,268 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-11-23 14:24:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1572 transitions. [2022-11-23 14:24:10,272 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1572 transitions. Word has length 5 [2022-11-23 14:24:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:10,273 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 1572 transitions. [2022-11-23 14:24:10,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1572 transitions. [2022-11-23 14:24:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:24:10,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:10,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:24:10,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:24:10,274 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-11-23 14:24:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash 720503191, now seen corresponding path program 1 times [2022-11-23 14:24:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:10,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809082811] [2022-11-23 14:24:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:10,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:10,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809082811] [2022-11-23 14:24:10,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809082811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:10,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:10,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:24:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583993991] [2022-11-23 14:24:10,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:10,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:10,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:10,354 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-11-23 14:24:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:10,419 INFO L93 Difference]: Finished difference Result 392 states and 1030 transitions. [2022-11-23 14:24:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:10,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-23 14:24:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:10,422 INFO L225 Difference]: With dead ends: 392 [2022-11-23 14:24:10,423 INFO L226 Difference]: Without dead ends: 392 [2022-11-23 14:24:10,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:10,424 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:10,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-23 14:24:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-11-23 14:24:10,435 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-11-23 14:24:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1030 transitions. [2022-11-23 14:24:10,437 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1030 transitions. Word has length 5 [2022-11-23 14:24:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:10,438 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 1030 transitions. [2022-11-23 14:24:10,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1030 transitions. [2022-11-23 14:24:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:24:10,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:10,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:24:10,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:24:10,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 859900896, now seen corresponding path program 1 times [2022-11-23 14:24:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:10,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261661702] [2022-11-23 14:24:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:10,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:10,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261661702] [2022-11-23 14:24:10,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261661702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:10,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:10,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:24:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126408638] [2022-11-23 14:24:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:10,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:24:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:24:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:24:10,603 INFO L87 Difference]: Start difference. First operand 392 states and 1030 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:10,732 INFO L93 Difference]: Finished difference Result 451 states and 1170 transitions. [2022-11-23 14:24:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:24:10,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:24:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:10,736 INFO L225 Difference]: With dead ends: 451 [2022-11-23 14:24:10,736 INFO L226 Difference]: Without dead ends: 451 [2022-11-23 14:24:10,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:10,738 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:10,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-11-23 14:24:10,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 362. [2022-11-23 14:24:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 350 states have (on average 2.72) internal successors, (952), 361 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 952 transitions. [2022-11-23 14:24:10,751 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 952 transitions. Word has length 6 [2022-11-23 14:24:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:10,752 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 952 transitions. [2022-11-23 14:24:10,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 952 transitions. [2022-11-23 14:24:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:24:10,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:10,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:24:10,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:24:10,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash 859900897, now seen corresponding path program 1 times [2022-11-23 14:24:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:10,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704838218] [2022-11-23 14:24:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:11,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:11,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704838218] [2022-11-23 14:24:11,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704838218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:11,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:11,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:24:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658769601] [2022-11-23 14:24:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:11,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:24:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:24:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:24:11,121 INFO L87 Difference]: Start difference. First operand 362 states and 952 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:11,288 INFO L93 Difference]: Finished difference Result 440 states and 1128 transitions. [2022-11-23 14:24:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:24:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:24:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:11,292 INFO L225 Difference]: With dead ends: 440 [2022-11-23 14:24:11,293 INFO L226 Difference]: Without dead ends: 440 [2022-11-23 14:24:11,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:11,294 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:11,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-23 14:24:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 428. [2022-11-23 14:24:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 416 states have (on average 2.6778846153846154) internal successors, (1114), 427 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1114 transitions. [2022-11-23 14:24:11,309 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1114 transitions. Word has length 6 [2022-11-23 14:24:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:11,310 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 1114 transitions. [2022-11-23 14:24:11,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1114 transitions. [2022-11-23 14:24:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:24:11,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:11,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:11,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:24:11,312 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:11,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:11,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1366824338, now seen corresponding path program 1 times [2022-11-23 14:24:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:11,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116706407] [2022-11-23 14:24:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:11,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116706407] [2022-11-23 14:24:11,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116706407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:11,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:11,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:24:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479180652] [2022-11-23 14:24:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:11,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:11,366 INFO L87 Difference]: Start difference. First operand 428 states and 1114 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-11-23 14:24:11,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:11,455 INFO L93 Difference]: Finished difference Result 458 states and 1192 transitions. [2022-11-23 14:24:11,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:11,456 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-11-23 14:24:11,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:11,459 INFO L225 Difference]: With dead ends: 458 [2022-11-23 14:24:11,459 INFO L226 Difference]: Without dead ends: 458 [2022-11-23 14:24:11,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:11,460 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:11,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-11-23 14:24:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2022-11-23 14:24:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 446 states have (on average 2.672645739910314) internal successors, (1192), 457 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1192 transitions. [2022-11-23 14:24:11,475 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1192 transitions. Word has length 10 [2022-11-23 14:24:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:11,476 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 1192 transitions. [2022-11-23 14:24:11,476 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-11-23 14:24:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1192 transitions. [2022-11-23 14:24:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:24:11,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:11,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:11,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:24:11,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2006710853, now seen corresponding path program 1 times [2022-11-23 14:24:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:11,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142598656] [2022-11-23 14:24:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:11,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:11,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142598656] [2022-11-23 14:24:11,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142598656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:11,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:11,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:24:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806251842] [2022-11-23 14:24:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:11,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:11,522 INFO L87 Difference]: Start difference. First operand 458 states and 1192 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-11-23 14:24:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:11,621 INFO L93 Difference]: Finished difference Result 476 states and 1233 transitions. [2022-11-23 14:24:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:11,622 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-11-23 14:24:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:11,625 INFO L225 Difference]: With dead ends: 476 [2022-11-23 14:24:11,625 INFO L226 Difference]: Without dead ends: 476 [2022-11-23 14:24:11,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:11,626 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:11,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-23 14:24:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 440. [2022-11-23 14:24:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 428 states have (on average 2.677570093457944) internal successors, (1146), 439 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1146 transitions. [2022-11-23 14:24:11,641 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1146 transitions. Word has length 13 [2022-11-23 14:24:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:11,642 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 1146 transitions. [2022-11-23 14:24:11,642 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-11-23 14:24:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1146 transitions. [2022-11-23 14:24:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:24:11,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:11,643 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:11,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:24:11,644 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1519702029, now seen corresponding path program 1 times [2022-11-23 14:24:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:11,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896365950] [2022-11-23 14:24:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:12,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896365950] [2022-11-23 14:24:12,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896365950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533775301] [2022-11-23 14:24:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:12,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:12,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:12,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:24:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:12,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-23 14:24:12,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:12,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:12,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:12,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:12,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 14:24:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:12,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:12,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533775301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:12,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [286686395] [2022-11-23 14:24:12,727 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:336) 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-11-23 14:24:12,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:12,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2022-11-23 14:24:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796028997] [2022-11-23 14:24:12,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:12,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 14:24:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 14:24:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-23 14:24:12,732 INFO L87 Difference]: Start difference. First operand 440 states and 1146 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:13,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:13,870 INFO L93 Difference]: Finished difference Result 1062 states and 2727 transitions. [2022-11-23 14:24:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:24:13,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 14:24:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:13,876 INFO L225 Difference]: With dead ends: 1062 [2022-11-23 14:24:13,876 INFO L226 Difference]: Without dead ends: 1062 [2022-11-23 14:24:13,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-11-23 14:24:13,877 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:13,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 2 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:24:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-11-23 14:24:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 764. [2022-11-23 14:24:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 752 states have (on average 2.7367021276595747) internal successors, (2058), 763 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2058 transitions. [2022-11-23 14:24:13,903 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2058 transitions. Word has length 13 [2022-11-23 14:24:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:13,904 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 2058 transitions. [2022-11-23 14:24:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2058 transitions. [2022-11-23 14:24:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:24:13,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:13,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:13,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:14,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 14:24:14,112 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:14,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1444222860, now seen corresponding path program 1 times [2022-11-23 14:24:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:14,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522785831] [2022-11-23 14:24:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:14,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:14,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522785831] [2022-11-23 14:24:14,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522785831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:14,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:14,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:24:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228341055] [2022-11-23 14:24:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:14,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:14,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:14,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:14,283 INFO L87 Difference]: Start difference. First operand 764 states and 2058 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-11-23 14:24:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:14,362 INFO L93 Difference]: Finished difference Result 364 states and 831 transitions. [2022-11-23 14:24:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:14,363 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-11-23 14:24:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:14,365 INFO L225 Difference]: With dead ends: 364 [2022-11-23 14:24:14,366 INFO L226 Difference]: Without dead ends: 364 [2022-11-23 14:24:14,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:14,367 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:14,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-23 14:24:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 354. [2022-11-23 14:24:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 348 states have (on average 2.32183908045977) internal successors, (808), 353 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 808 transitions. [2022-11-23 14:24:14,379 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 808 transitions. Word has length 18 [2022-11-23 14:24:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:14,379 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 808 transitions. [2022-11-23 14:24:14,379 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-11-23 14:24:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 808 transitions. [2022-11-23 14:24:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 14:24:14,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:14,381 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-11-23 14:24:14,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:24:14,381 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1337344503, now seen corresponding path program 1 times [2022-11-23 14:24:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:14,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299855656] [2022-11-23 14:24:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:14,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:14,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:14,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299855656] [2022-11-23 14:24:14,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299855656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:14,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:14,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 14:24:14,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189205214] [2022-11-23 14:24:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:14,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 14:24:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 14:24:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:24:14,883 INFO L87 Difference]: Start difference. First operand 354 states and 808 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-11-23 14:24:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:15,746 INFO L93 Difference]: Finished difference Result 510 states and 1131 transitions. [2022-11-23 14:24:15,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 14:24:15,747 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-11-23 14:24:15,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:15,750 INFO L225 Difference]: With dead ends: 510 [2022-11-23 14:24:15,750 INFO L226 Difference]: Without dead ends: 510 [2022-11-23 14:24:15,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-11-23 14:24:15,751 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:15,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 14:24:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-23 14:24:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 424. [2022-11-23 14:24:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 418 states have (on average 2.3636363636363638) internal successors, (988), 423 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 988 transitions. [2022-11-23 14:24:15,770 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 988 transitions. Word has length 19 [2022-11-23 14:24:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:15,770 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 988 transitions. [2022-11-23 14:24:15,770 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-11-23 14:24:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 988 transitions. [2022-11-23 14:24:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 14:24:15,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:15,772 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-11-23 14:24:15,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 14:24:15,772 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-11-23 14:24:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1337344504, now seen corresponding path program 1 times [2022-11-23 14:24:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:15,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095966451] [2022-11-23 14:24:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:15,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:15,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095966451] [2022-11-23 14:24:15,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095966451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:15,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:15,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:24:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815656553] [2022-11-23 14:24:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:15,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:24:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:24:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:24:15,880 INFO L87 Difference]: Start difference. First operand 424 states and 988 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-23 14:24:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:16,054 INFO L93 Difference]: Finished difference Result 507 states and 1189 transitions. [2022-11-23 14:24:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:24:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-23 14:24:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:16,057 INFO L225 Difference]: With dead ends: 507 [2022-11-23 14:24:16,057 INFO L226 Difference]: Without dead ends: 507 [2022-11-23 14:24:16,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:24:16,059 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:16,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 8 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-23 14:24:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 418. [2022-11-23 14:24:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 413 states have (on average 2.348668280871671) internal successors, (970), 417 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 970 transitions. [2022-11-23 14:24:16,072 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 970 transitions. Word has length 19 [2022-11-23 14:24:16,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:16,073 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 970 transitions. [2022-11-23 14:24:16,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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-11-23 14:24:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 970 transitions. [2022-11-23 14:24:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:24:16,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:16,074 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-11-23 14:24:16,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 14:24:16,074 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:16,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash 723421545, now seen corresponding path program 1 times [2022-11-23 14:24:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:16,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742305235] [2022-11-23 14:24:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:16,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:16,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742305235] [2022-11-23 14:24:16,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742305235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:16,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589075130] [2022-11-23 14:24:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:16,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:16,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:16,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:16,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:24:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:16,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:24:16,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:16,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:16,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589075130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:16,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:16,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-23 14:24:16,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401337670] [2022-11-23 14:24:16,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:16,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:16,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:16,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:16,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:24:16,345 INFO L87 Difference]: Start difference. First operand 418 states and 970 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-11-23 14:24:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:16,457 INFO L93 Difference]: Finished difference Result 602 states and 1357 transitions. [2022-11-23 14:24:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:16,458 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-11-23 14:24:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:16,461 INFO L225 Difference]: With dead ends: 602 [2022-11-23 14:24:16,462 INFO L226 Difference]: Without dead ends: 602 [2022-11-23 14:24:16,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-11-23 14:24:16,463 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:16,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-11-23 14:24:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 484. [2022-11-23 14:24:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 477 states have (on average 2.291404612159329) internal successors, (1093), 483 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1093 transitions. [2022-11-23 14:24:16,487 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1093 transitions. Word has length 20 [2022-11-23 14:24:16,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:16,489 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 1093 transitions. [2022-11-23 14:24:16,489 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-11-23 14:24:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1093 transitions. [2022-11-23 14:24:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:24:16,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:16,491 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-23 14:24:16,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:16,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 14:24:16,697 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1210431682, now seen corresponding path program 1 times [2022-11-23 14:24:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:16,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655558842] [2022-11-23 14:24:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:16,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:16,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655558842] [2022-11-23 14:24:16,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655558842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:16,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624141619] [2022-11-23 14:24:16,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:16,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:16,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:16,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:16,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:24:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:16,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:24:16,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:17,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:17,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624141619] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:17,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1584461461] [2022-11-23 14:24:17,092 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:336) 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-11-23 14:24:17,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:17,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-23 14:24:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016019186] [2022-11-23 14:24:17,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:24:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:24:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-23 14:24:17,095 INFO L87 Difference]: Start difference. First operand 484 states and 1093 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:17,474 INFO L93 Difference]: Finished difference Result 1032 states and 2257 transitions. [2022-11-23 14:24:17,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 14:24:17,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 14:24:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:17,479 INFO L225 Difference]: With dead ends: 1032 [2022-11-23 14:24:17,479 INFO L226 Difference]: Without dead ends: 1032 [2022-11-23 14:24:17,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-11-23 14:24:17,480 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:17,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:24:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-11-23 14:24:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 696. [2022-11-23 14:24:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 689 states have (on average 2.294629898403483) internal successors, (1581), 695 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1581 transitions. [2022-11-23 14:24:17,505 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1581 transitions. Word has length 20 [2022-11-23 14:24:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:17,505 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 1581 transitions. [2022-11-23 14:24:17,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1581 transitions. [2022-11-23 14:24:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:24:17,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:17,507 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-11-23 14:24:17,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:17,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:17,713 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash 992748458, now seen corresponding path program 1 times [2022-11-23 14:24:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:17,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702970049] [2022-11-23 14:24:17,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:18,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:18,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702970049] [2022-11-23 14:24:18,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702970049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:18,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:18,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 14:24:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761247324] [2022-11-23 14:24:18,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:18,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 14:24:18,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 14:24:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-11-23 14:24:18,892 INFO L87 Difference]: Start difference. First operand 696 states and 1581 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-11-23 14:24:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:20,445 INFO L93 Difference]: Finished difference Result 762 states and 1705 transitions. [2022-11-23 14:24:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 14:24:20,445 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-11-23 14:24:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:20,448 INFO L225 Difference]: With dead ends: 762 [2022-11-23 14:24:20,449 INFO L226 Difference]: Without dead ends: 762 [2022-11-23 14:24:20,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-11-23 14:24:20,450 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:20,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 14:24:20,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-11-23 14:24:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 696. [2022-11-23 14:24:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 689 states have (on average 2.285921625544267) internal successors, (1575), 695 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1575 transitions. [2022-11-23 14:24:20,473 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1575 transitions. Word has length 21 [2022-11-23 14:24:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:20,474 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 1575 transitions. [2022-11-23 14:24:20,474 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-11-23 14:24:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1575 transitions. [2022-11-23 14:24:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 14:24:20,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:20,476 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-11-23 14:24:20,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 14:24:20,476 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1113889011, now seen corresponding path program 1 times [2022-11-23 14:24:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:20,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360418668] [2022-11-23 14:24:20,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:20,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:20,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360418668] [2022-11-23 14:24:20,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360418668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:20,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660784068] [2022-11-23 14:24:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:20,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:20,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:20,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:20,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:24:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:20,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:24:20,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:20,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:20,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660784068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:20,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1450077425] [2022-11-23 14:24:20,764 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:336) 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-11-23 14:24:20,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:20,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 14:24:20,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764163519] [2022-11-23 14:24:20,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:20,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:24:20,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:20,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:24:20,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:24:20,769 INFO L87 Difference]: Start difference. First operand 696 states and 1575 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-11-23 14:24:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:21,018 INFO L93 Difference]: Finished difference Result 1570 states and 3397 transitions. [2022-11-23 14:24:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:24:21,019 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-11-23 14:24:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:21,027 INFO L225 Difference]: With dead ends: 1570 [2022-11-23 14:24:21,027 INFO L226 Difference]: Without dead ends: 1570 [2022-11-23 14:24:21,027 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-11-23 14:24:21,028 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:21,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 5 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:24:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-11-23 14:24:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1522. [2022-11-23 14:24:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1515 states have (on average 2.2145214521452146) internal successors, (3355), 1521 states have internal predecessors, (3355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 3355 transitions. [2022-11-23 14:24:21,077 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 3355 transitions. Word has length 23 [2022-11-23 14:24:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:21,077 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 3355 transitions. [2022-11-23 14:24:21,078 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-11-23 14:24:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 3355 transitions. [2022-11-23 14:24:21,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 14:24:21,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:21,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:24:21,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:21,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 14:24:21,287 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-11-23 14:24:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash 948669403, now seen corresponding path program 1 times [2022-11-23 14:24:21,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:21,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873208904] [2022-11-23 14:24:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:24:21,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:21,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873208904] [2022-11-23 14:24:21,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873208904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:21,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:24:21,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:24:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118441167] [2022-11-23 14:24:21,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:21,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:24:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:21,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:24:21,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:21,339 INFO L87 Difference]: Start difference. First operand 1522 states and 3355 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-11-23 14:24:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:21,434 INFO L93 Difference]: Finished difference Result 1660 states and 3588 transitions. [2022-11-23 14:24:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:24:21,435 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-11-23 14:24:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:21,443 INFO L225 Difference]: With dead ends: 1660 [2022-11-23 14:24:21,444 INFO L226 Difference]: Without dead ends: 1660 [2022-11-23 14:24:21,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:24:21,445 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:21,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:24:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2022-11-23 14:24:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1428. [2022-11-23 14:24:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1421 states have (on average 2.1498944405348346) internal successors, (3055), 1427 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3055 transitions. [2022-11-23 14:24:21,491 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3055 transitions. Word has length 24 [2022-11-23 14:24:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:21,492 INFO L495 AbstractCegarLoop]: Abstraction has 1428 states and 3055 transitions. [2022-11-23 14:24:21,492 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-11-23 14:24:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3055 transitions. [2022-11-23 14:24:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 14:24:21,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:21,497 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-11-23 14:24:21,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 14:24:21,497 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:21,498 INFO L85 PathProgramCache]: Analyzing trace with hash -173931243, now seen corresponding path program 1 times [2022-11-23 14:24:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:21,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989473293] [2022-11-23 14:24:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:21,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:22,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:22,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989473293] [2022-11-23 14:24:22,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989473293] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:22,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294069802] [2022-11-23 14:24:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:22,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:22,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:22,217 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:22,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:24:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:22,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:24:22,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:22,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:23,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:24:23,254 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-11-23 14:24:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:23,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294069802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:23,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [654244024] [2022-11-23 14:24:23,432 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:336) 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-11-23 14:24:23,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:23,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 33 [2022-11-23 14:24:23,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99442749] [2022-11-23 14:24:23,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:23,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 14:24:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 14:24:23,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 14:24:23,435 INFO L87 Difference]: Start difference. First operand 1428 states and 3055 transitions. Second operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:27,971 INFO L93 Difference]: Finished difference Result 2682 states and 5675 transitions. [2022-11-23 14:24:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-23 14:24:27,972 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 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-11-23 14:24:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:27,986 INFO L225 Difference]: With dead ends: 2682 [2022-11-23 14:24:27,986 INFO L226 Difference]: Without dead ends: 2682 [2022-11-23 14:24:27,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1337, Invalid=5635, Unknown=0, NotChecked=0, Total=6972 [2022-11-23 14:24:27,989 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 924 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:27,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 0 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-23 14:24:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2022-11-23 14:24:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 1614. [2022-11-23 14:24:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1607 states have (on average 2.221530802738021) internal successors, (3570), 1613 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 3570 transitions. [2022-11-23 14:24:28,052 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 3570 transitions. Word has length 24 [2022-11-23 14:24:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:28,053 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 3570 transitions. [2022-11-23 14:24:28,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 3570 transitions. [2022-11-23 14:24:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 14:24:28,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:28,055 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-11-23 14:24:28,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:28,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:28,261 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash -173929930, now seen corresponding path program 1 times [2022-11-23 14:24:28,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:28,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347830643] [2022-11-23 14:24:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:28,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347830643] [2022-11-23 14:24:28,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347830643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:28,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068140354] [2022-11-23 14:24:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:28,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:28,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:28,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:24:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:28,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:24:28,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:24:28,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:28,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068140354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:28,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:28,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-23 14:24:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428558175] [2022-11-23 14:24:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:28,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:24:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:24:28,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:24:28,641 INFO L87 Difference]: Start difference. First operand 1614 states and 3570 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-11-23 14:24:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:28,843 INFO L93 Difference]: Finished difference Result 1940 states and 4194 transitions. [2022-11-23 14:24:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:24:28,843 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-11-23 14:24:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:28,853 INFO L225 Difference]: With dead ends: 1940 [2022-11-23 14:24:28,853 INFO L226 Difference]: Without dead ends: 1940 [2022-11-23 14:24:28,853 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-11-23 14:24:28,854 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:28,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:24:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2022-11-23 14:24:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1802. [2022-11-23 14:24:28,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1795 states have (on average 2.2094707520891363) internal successors, (3966), 1801 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 3966 transitions. [2022-11-23 14:24:28,916 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 3966 transitions. Word has length 24 [2022-11-23 14:24:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:28,917 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 3966 transitions. [2022-11-23 14:24:28,917 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-11-23 14:24:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 3966 transitions. [2022-11-23 14:24:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:24:28,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:28,919 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-11-23 14:24:28,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:29,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:29,131 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:24:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:29,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1136577317, now seen corresponding path program 2 times [2022-11-23 14:24:29,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:29,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279971693] [2022-11-23 14:24:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:29,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:29,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279971693] [2022-11-23 14:24:29,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279971693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:29,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707883501] [2022-11-23 14:24:29,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:24:29,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:29,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:29,607 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:29,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:24:29,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 14:24:29,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:29,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:24:29,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:30,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:30,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707883501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:30,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:30,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 22 [2022-11-23 14:24:30,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473286636] [2022-11-23 14:24:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:30,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 14:24:30,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:30,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 14:24:30,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2022-11-23 14:24:30,181 INFO L87 Difference]: Start difference. First operand 1802 states and 3966 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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-11-23 14:24:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:31,397 INFO L93 Difference]: Finished difference Result 2356 states and 5079 transitions. [2022-11-23 14:24:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 14:24:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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-11-23 14:24:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:31,409 INFO L225 Difference]: With dead ends: 2356 [2022-11-23 14:24:31,409 INFO L226 Difference]: Without dead ends: 2356 [2022-11-23 14:24:31,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 14:24:31,410 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:31,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:24:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2022-11-23 14:24:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1942. [2022-11-23 14:24:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1935 states have (on average 2.1891472868217052) internal successors, (4236), 1941 states have internal predecessors, (4236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 4236 transitions. [2022-11-23 14:24:31,470 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 4236 transitions. Word has length 26 [2022-11-23 14:24:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:31,470 INFO L495 AbstractCegarLoop]: Abstraction has 1942 states and 4236 transitions. [2022-11-23 14:24:31,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 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-11-23 14:24:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 4236 transitions. [2022-11-23 14:24:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 14:24:31,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:31,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-23 14:24:31,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 14:24:31,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 14:24:31,678 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-11-23 14:24:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -718385101, now seen corresponding path program 2 times [2022-11-23 14:24:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:31,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130914749] [2022-11-23 14:24:31,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:32,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:32,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:32,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130914749] [2022-11-23 14:24:32,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130914749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:32,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149132541] [2022-11-23 14:24:32,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:24:32,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:32,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:32,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:32,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:24:32,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 14:24:32,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:32,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-23 14:24:32,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:32,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:32,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:32,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:24:32,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2022-11-23 14:24:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 14:24:33,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:24:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 14:24:34,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149132541] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:24:34,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [645005651] [2022-11-23 14:24:34,148 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:336) 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-11-23 14:24:34,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:24:34,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2022-11-23 14:24:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164178419] [2022-11-23 14:24:34,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:24:34,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 14:24:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:34,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 14:24:34,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2022-11-23 14:24:34,171 INFO L87 Difference]: Start difference. First operand 1942 states and 4236 transitions. Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 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-11-23 14:24:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:24:36,604 INFO L93 Difference]: Finished difference Result 2298 states and 4781 transitions. [2022-11-23 14:24:36,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 14:24:36,605 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 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-11-23 14:24:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:24:36,615 INFO L225 Difference]: With dead ends: 2298 [2022-11-23 14:24:36,615 INFO L226 Difference]: Without dead ends: 2298 [2022-11-23 14:24:36,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=475, Invalid=1975, Unknown=0, NotChecked=0, Total=2450 [2022-11-23 14:24:36,616 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 762 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:24:36,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 4 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 14:24:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2022-11-23 14:24:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1554. [2022-11-23 14:24:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1549 states have (on average 2.120723047127179) internal successors, (3285), 1553 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:24:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 3285 transitions. [2022-11-23 14:24:36,701 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 3285 transitions. Word has length 27 [2022-11-23 14:24:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:24:36,701 INFO L495 AbstractCegarLoop]: Abstraction has 1554 states and 3285 transitions. [2022-11-23 14:24:36,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 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-11-23 14:24:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 3285 transitions. [2022-11-23 14:24:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 14:24:36,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:24:36,704 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-11-23 14:24:36,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:24:36,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-23 14:24:36,910 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-11-23 14:24:36,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:24:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1329011032, now seen corresponding path program 2 times [2022-11-23 14:24:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:24:36,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797383807] [2022-11-23 14:24:36,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:24:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:24:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:24:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:24:38,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:24:38,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797383807] [2022-11-23 14:24:38,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797383807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:24:38,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191122565] [2022-11-23 14:24:38,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:24:38,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:24:38,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:24:38,047 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:24:38,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 14:24:38,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 14:24:38,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:24:38,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 14:24:38,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:24:38,246 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 14:24:38,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-23 14:24:38,652 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-11-23 14:24:38,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2022-11-23 14:24:39,400 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-11-23 14:24:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:24:44,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:24:44,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191122565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:24:44,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:24:44,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 30 [2022-11-23 14:24:44,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660192516] [2022-11-23 14:24:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:24:44,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 14:24:44,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:24:44,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 14:24:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=920, Unknown=1, NotChecked=0, Total=992 [2022-11-23 14:24:44,672 INFO L87 Difference]: Start difference. First operand 1554 states and 3285 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-11-23 14:24:47,843 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-11-23 14:24:49,996 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-11-23 14:24:52,039 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-11-23 14:24:54,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:24:56,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-11-23 14:24:58,609 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-11-23 14:24:59,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:25:01,977 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-11-23 14:25:04,010 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-11-23 14:25:06,213 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-11-23 14:25:08,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:25:10,944 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-11-23 14:25:12,993 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-11-23 14:25:14,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:25:16,995 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-11-23 14:25:19,065 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-11-23 14:25:21,142 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-11-23 14:25:22,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:25:24,507 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-11-23 14:25:26,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-11-23 14:25:29,187 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-11-23 14:25:31,359 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-11-23 14:25:32,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:25:34,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:25:36,313 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-11-23 14:25:38,362 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-11-23 14:25:40,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:25:42,250 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-11-23 14:25:44,384 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-11-23 14:25:46,424 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-11-23 14:25:48,644 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-11-23 14:25:50,680 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-11-23 14:25:52,714 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-11-23 14:25:54,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-11-23 14:25:56,975 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-11-23 14:25:59,006 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-11-23 14:26:01,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-11-23 14:26:03,330 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-11-23 14:26:05,681 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-11-23 14:26:07,708 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-11-23 14:26:09,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:26:11,777 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-11-23 14:26:13,823 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-11-23 14:26:15,853 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-11-23 14:26:18,391 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-11-23 14:26:20,427 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-11-23 14:26:22,484 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-11-23 14:26:24,515 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-11-23 14:26:26,540 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-11-23 14:26:28,769 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-11-23 14:26:30,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-11-23 14:26:32,855 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-11-23 14:26:37,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:26:39,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-11-23 14:26:41,850 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-11-23 14:26:43,904 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-11-23 14:26:45,954 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-11-23 14:26:47,980 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-11-23 14:26:50,007 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-11-23 14:26:52,036 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-11-23 14:26:54,182 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-11-23 14:26:56,243 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-11-23 14:26:58,268 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-11-23 14:27:00,312 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-11-23 14:27:02,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-11-23 14:27:04,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:27:06,747 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-11-23 14:27:08,783 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-11-23 14:27:11,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-11-23 14:27:13,901 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-11-23 14:27:15,926 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-11-23 14:27:17,956 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-11-23 14:27:20,499 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-11-23 14:27:22,526 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-11-23 14:27:25,846 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-11-23 14:27:28,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:27:30,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:27:32,953 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-11-23 14:27:35,253 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-11-23 14:27:37,286 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-11-23 14:27:39,305 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-11-23 14:27:41,331 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-11-23 14:27:43,364 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-11-23 14:27:44,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:27:46,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:27:48,071 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-11-23 14:27:51,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:27:53,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-11-23 14:27:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:54,487 INFO L93 Difference]: Finished difference Result 1866 states and 3886 transitions. [2022-11-23 14:27:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 14:27:54,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-11-23 14:27:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:54,494 INFO L225 Difference]: With dead ends: 1866 [2022-11-23 14:27:54,494 INFO L226 Difference]: Without dead ends: 1866 [2022-11-23 14:27:54,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=308, Invalid=2661, Unknown=1, NotChecked=0, Total=2970 [2022-11-23 14:27:54,495 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 20 mSolverCounterUnsat, 76 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 182.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 76 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 184.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:54,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 906 Invalid, 76 Unknown, 0 Unchecked, 184.1s Time] [2022-11-23 14:27:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-11-23 14:27:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1406. [2022-11-23 14:27:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1401 states have (on average 2.1127765881513203) internal successors, (2960), 1405 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2960 transitions. [2022-11-23 14:27:54,532 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2960 transitions. Word has length 28 [2022-11-23 14:27:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:54,532 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 2960 transitions. [2022-11-23 14:27:54,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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-11-23 14:27:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2960 transitions. [2022-11-23 14:27:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 14:27:54,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:54,535 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:54,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:54,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 14:27:54,740 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:27:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1560677832, now seen corresponding path program 2 times [2022-11-23 14:27:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:27:54,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13298520] [2022-11-23 14:27:54,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:54,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:27:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:27:54,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:27:54,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13298520] [2022-11-23 14:27:54,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13298520] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:27:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725203286] [2022-11-23 14:27:54,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:27:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:27:54,952 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:27:54,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 14:27:55,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 14:27:55,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:27:55,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 14:27:55,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:27:55,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:55,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725203286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:55,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:27:55,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2022-11-23 14:27:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703700273] [2022-11-23 14:27:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:55,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:27:55,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:27:55,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:27:55,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:27:55,252 INFO L87 Difference]: Start difference. First operand 1406 states and 2960 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-11-23 14:27:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:55,622 INFO L93 Difference]: Finished difference Result 1656 states and 3461 transitions. [2022-11-23 14:27:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:27:55,623 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 31 [2022-11-23 14:27:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:55,628 INFO L225 Difference]: With dead ends: 1656 [2022-11-23 14:27:55,629 INFO L226 Difference]: Without dead ends: 1656 [2022-11-23 14:27:55,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-11-23 14:27:55,630 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:55,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:27:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-11-23 14:27:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1420. [2022-11-23 14:27:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1415 states have (on average 2.1307420494699647) internal successors, (3015), 1419 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 3015 transitions. [2022-11-23 14:27:55,679 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 3015 transitions. Word has length 31 [2022-11-23 14:27:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:55,680 INFO L495 AbstractCegarLoop]: Abstraction has 1420 states and 3015 transitions. [2022-11-23 14:27:55,680 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-11-23 14:27:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 3015 transitions. [2022-11-23 14:27:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:27:55,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:55,683 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-11-23 14:27:55,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:55,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:55,896 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:27:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash 969332807, now seen corresponding path program 2 times [2022-11-23 14:27:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:27:55,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391544152] [2022-11-23 14:27:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:55,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:27:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 14:27:56,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:27:56,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391544152] [2022-11-23 14:27:56,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391544152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:27:56,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190230943] [2022-11-23 14:27:56,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:27:56,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:56,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:27:56,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:27:56,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 14:27:56,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 14:27:56,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:27:56,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 14:27:56,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-23 14:27:56,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:56,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190230943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:56,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:27:56,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2022-11-23 14:27:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067236981] [2022-11-23 14:27:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:56,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:27:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:27:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:27:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:27:56,562 INFO L87 Difference]: Start difference. First operand 1420 states and 3015 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-11-23 14:27:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:56,645 INFO L93 Difference]: Finished difference Result 1419 states and 3014 transitions. [2022-11-23 14:27:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:27:56,646 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-11-23 14:27:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:56,650 INFO L225 Difference]: With dead ends: 1419 [2022-11-23 14:27:56,650 INFO L226 Difference]: Without dead ends: 1236 [2022-11-23 14:27:56,650 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-11-23 14:27:56,651 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:56,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:27:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-11-23 14:27:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1028. [2022-11-23 14:27:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1024 states have (on average 2.1181640625) internal successors, (2169), 1027 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-11-23 14:27:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 2169 transitions. [2022-11-23 14:27:56,680 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 2169 transitions. Word has length 32 [2022-11-23 14:27:56,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:56,680 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 2169 transitions. [2022-11-23 14:27:56,680 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-11-23 14:27:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 2169 transitions. [2022-11-23 14:27:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:27:56,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:56,683 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-11-23 14:27:56,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 14:27:56,899 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:27:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1549235757, now seen corresponding path program 1 times [2022-11-23 14:27:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:27:56,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546533875] [2022-11-23 14:27:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:27:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 14:27:57,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:27:57,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546533875] [2022-11-23 14:27:57,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546533875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:27:57,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818838688] [2022-11-23 14:27:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:57,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:27:57,530 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:27:57,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 14:27:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:57,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 14:27:57,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:27:58,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:59,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:59,343 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 37 treesize of output 41 [2022-11-23 14:27:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:27:59,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818838688] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:59,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [899972175] [2022-11-23 14:27:59,619 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:336) 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-11-23 14:27:59,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:27:59,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 33 [2022-11-23 14:27:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832651494] [2022-11-23 14:27:59,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:27:59,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 14:27:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:27:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 14:27:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 14:27:59,621 INFO L87 Difference]: Start difference. First operand 1028 states and 2169 transitions. Second operand has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:28:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:28:05,269 INFO L93 Difference]: Finished difference Result 1650 states and 3353 transitions. [2022-11-23 14:28:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-23 14:28:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 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-11-23 14:28:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:28:05,274 INFO L225 Difference]: With dead ends: 1650 [2022-11-23 14:28:05,274 INFO L226 Difference]: Without dead ends: 1650 [2022-11-23 14:28:05,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=952, Invalid=3604, Unknown=0, NotChecked=0, Total=4556 [2022-11-23 14:28:05,276 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 527 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:28:05,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 0 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-23 14:28:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-11-23 14:28:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1022. [2022-11-23 14:28:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1019 states have (on average 2.108930323846909) internal successors, (2149), 1021 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:28:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 2149 transitions. [2022-11-23 14:28:05,305 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 2149 transitions. Word has length 34 [2022-11-23 14:28:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:28:05,306 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 2149 transitions. [2022-11-23 14:28:05,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.911764705882353) internal successors, (99), 34 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:28:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2149 transitions. [2022-11-23 14:28:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 14:28:05,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:28:05,308 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-11-23 14:28:05,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 14:28:05,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-23 14:28:05,515 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-11-23 14:28:05,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:28:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1537991814, now seen corresponding path program 1 times [2022-11-23 14:28:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:28:05,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272415529] [2022-11-23 14:28:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:28:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:28:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:28:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:28:07,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:28:07,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272415529] [2022-11-23 14:28:07,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272415529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:28:07,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854049288] [2022-11-23 14:28:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:28:07,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:28:07,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:28:07,675 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:28:07,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 14:28:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:28:08,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-23 14:28:08,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:28:08,055 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 14:28:08,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-23 14:28:08,582 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-11-23 14:28:09,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:28:09,339 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-11-23 14:28:09,634 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-11-23 14:28:10,684 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-11-23 14:28:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:28:25,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:28:28,181 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2022-11-23 14:28:28,181 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 2 case distinctions, treesize of input 53 treesize of output 60 [2022-11-23 14:28:28,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:28:28,199 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 67 treesize of output 70 [2022-11-23 14:28:28,206 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-11-23 14:28:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:28:30,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854049288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:28:30,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [177066642] [2022-11-23 14:28:30,751 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:336) 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-11-23 14:28:30,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:28:30,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 21] total 66 [2022-11-23 14:28:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398789006] [2022-11-23 14:28:30,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:28:30,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-23 14:28:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:28:30,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-23 14:28:30,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=4191, Unknown=24, NotChecked=0, Total=4556 [2022-11-23 14:28:30,755 INFO L87 Difference]: Start difference. First operand 1022 states and 2149 transitions. Second operand has 68 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 67 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-11-23 14:29:38,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 [1] [2022-11-23 14:32:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:13,413 INFO L93 Difference]: Finished difference Result 5347 states and 11051 transitions. [2022-11-23 14:32:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2022-11-23 14:32:13,414 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 67 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-11-23 14:32:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:13,427 INFO L225 Difference]: With dead ends: 5347 [2022-11-23 14:32:13,427 INFO L226 Difference]: Without dead ends: 5217 [2022-11-23 14:32:13,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26178 ImplicationChecksByTransitivity, 213.0s TimeCoverageRelationStatistics Valid=8100, Invalid=62465, Unknown=457, NotChecked=0, Total=71022 [2022-11-23 14:32:13,438 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10450 mSolverCounterSat, 299 mSolverCounterUnsat, 364 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 10450 IncrementalHoareTripleChecker+Invalid, 364 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:13,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 0 Invalid, 11113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [299 Valid, 10450 Invalid, 364 Unknown, 0 Unchecked, 30.9s Time] [2022-11-23 14:32:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2022-11-23 14:32:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 2707. [2022-11-23 14:32:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2707 states, 2704 states have (on average 2.1712278106508878) internal successors, (5871), 2706 states have internal predecessors, (5871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2707 states and 5871 transitions. [2022-11-23 14:32:13,523 INFO L78 Accepts]: Start accepts. Automaton has 2707 states and 5871 transitions. Word has length 36 [2022-11-23 14:32:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:13,524 INFO L495 AbstractCegarLoop]: Abstraction has 2707 states and 5871 transitions. [2022-11-23 14:32:13,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 67 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-11-23 14:32:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 5871 transitions. [2022-11-23 14:32:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-23 14:32:13,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:13,527 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-11-23 14:32:13,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 14:32:13,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 14:32:13,738 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-11-23 14:32:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash -432982548, now seen corresponding path program 2 times [2022-11-23 14:32:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:13,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364048066] [2022-11-23 14:32:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:13,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:16,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:16,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364048066] [2022-11-23 14:32:16,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364048066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:32:16,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150961544] [2022-11-23 14:32:16,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:32:16,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:32:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:32:16,015 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:32:16,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 14:32:16,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 14:32:16,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:32:16,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-23 14:32:16,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:32:16,334 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:32:16,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-23 14:32:16,840 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-11-23 14:32:17,129 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:32:17,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-11-23 14:32:17,137 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 20 [2022-11-23 14:32:17,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:32:17,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2022-11-23 14:32:17,786 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:32:17,786 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 58 treesize of output 56 [2022-11-23 14:32:19,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:32:19,189 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-11-23 14:32:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:35,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:32:38,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:38,057 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 38 treesize of output 39 [2022-11-23 14:32:38,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:38,076 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 67 treesize of output 71 [2022-11-23 14:32:38,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:32:38,084 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 44 treesize of output 37 [2022-11-23 14:32:38,100 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 10 treesize of output 4 [2022-11-23 14:32:38,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:32:38,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:38,123 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 44 treesize of output 48 [2022-11-23 14:32:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:38,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150961544] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:32:38,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1609356902] [2022-11-23 14:32:38,980 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:336) 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-11-23 14:32:38,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:32:38,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 64 [2022-11-23 14:32:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110020734] [2022-11-23 14:32:38,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:32:38,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-23 14:32:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:38,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-23 14:32:38,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3895, Unknown=3, NotChecked=0, Total=4290 [2022-11-23 14:32:38,983 INFO L87 Difference]: Start difference. First operand 2707 states and 5871 transitions. Second operand has 66 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 65 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-11-23 14:32:59,918 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-11-23 14:33:03,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:33:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:33:03,512 INFO L93 Difference]: Finished difference Result 4966 states and 10157 transitions. [2022-11-23 14:33:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-11-23 14:33:03,513 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 65 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-11-23 14:33:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:33:03,525 INFO L225 Difference]: With dead ends: 4966 [2022-11-23 14:33:03,525 INFO L226 Difference]: Without dead ends: 4817 [2022-11-23 14:33:03,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=1897, Invalid=13352, Unknown=3, NotChecked=0, Total=15252 [2022-11-23 14:33:03,527 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 854 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4781 mSolverCounterSat, 110 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 4781 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:33:03,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 0 Invalid, 4892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 4781 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2022-11-23 14:33:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4817 states. [2022-11-23 14:33:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4817 to 2955. [2022-11-23 14:33:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2952 states have (on average 2.138211382113821) internal successors, (6312), 2954 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 6312 transitions. [2022-11-23 14:33:03,609 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 6312 transitions. Word has length 36 [2022-11-23 14:33:03,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:33:03,609 INFO L495 AbstractCegarLoop]: Abstraction has 2955 states and 6312 transitions. [2022-11-23 14:33:03,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 65 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-11-23 14:33:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 6312 transitions. [2022-11-23 14:33:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-23 14:33:03,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:33:03,613 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-11-23 14:33:03,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:33:03,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-23 14:33:03,821 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:33:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:33:03,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1142909514, now seen corresponding path program 3 times [2022-11-23 14:33:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:33:03,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646634863] [2022-11-23 14:33:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:33:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:33:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:33:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:33:04,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:33:04,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646634863] [2022-11-23 14:33:04,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646634863] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:33:04,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000988079] [2022-11-23 14:33:04,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:33:04,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:33:04,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:33:04,142 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:33:04,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 14:33:04,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:33:04,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:33:04,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:33:04,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:33:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:33:04,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:33:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:33:04,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000988079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:33:04,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1923670423] [2022-11-23 14:33:04,610 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:336) 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-11-23 14:33:04,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:33:04,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-11-23 14:33:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997326208] [2022-11-23 14:33:04,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:33:04,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 14:33:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:33:04,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 14:33:04,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-11-23 14:33:04,612 INFO L87 Difference]: Start difference. First operand 2955 states and 6312 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:33:05,270 INFO L93 Difference]: Finished difference Result 4918 states and 10315 transitions. [2022-11-23 14:33:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:33:05,271 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 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-11-23 14:33:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:33:05,284 INFO L225 Difference]: With dead ends: 4918 [2022-11-23 14:33:05,285 INFO L226 Difference]: Without dead ends: 4918 [2022-11-23 14:33:05,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2022-11-23 14:33:05,286 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:33:05,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:33:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4918 states. [2022-11-23 14:33:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4918 to 3327. [2022-11-23 14:33:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3324 states have (on average 2.1630565583634174) internal successors, (7190), 3326 states have internal predecessors, (7190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 7190 transitions. [2022-11-23 14:33:05,375 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 7190 transitions. Word has length 38 [2022-11-23 14:33:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:33:05,376 INFO L495 AbstractCegarLoop]: Abstraction has 3327 states and 7190 transitions. [2022-11-23 14:33:05,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 7190 transitions. [2022-11-23 14:33:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 14:33:05,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:33:05,380 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-11-23 14:33:05,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 14:33:05,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 14:33:05,586 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-23 14:33:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:33:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1747712620, now seen corresponding path program 2 times [2022-11-23 14:33:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:33:05,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806170701] [2022-11-23 14:33:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:33:05,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:33:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:33:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:05,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:33:05,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806170701] [2022-11-23 14:33:05,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806170701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:33:05,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42723742] [2022-11-23 14:33:05,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:33:05,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:33:05,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:33:05,879 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:33:05,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 14:33:06,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-23 14:33:06,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:33:06,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 14:33:06,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:33:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:06,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:33:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:06,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42723742] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:33:06,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1182614610] [2022-11-23 14:33:06,597 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:336) 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-11-23 14:33:06,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:33:06,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2022-11-23 14:33:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233504401] [2022-11-23 14:33:06,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:33:06,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 14:33:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:33:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 14:33:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2022-11-23 14:33:06,599 INFO L87 Difference]: Start difference. First operand 3327 states and 7190 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:33:07,483 INFO L93 Difference]: Finished difference Result 6840 states and 14495 transitions. [2022-11-23 14:33:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 14:33:07,483 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-23 14:33:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:33:07,500 INFO L225 Difference]: With dead ends: 6840 [2022-11-23 14:33:07,500 INFO L226 Difference]: Without dead ends: 6840 [2022-11-23 14:33:07,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=923, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 14:33:07,503 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 434 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:33:07,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:33:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2022-11-23 14:33:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 5309. [2022-11-23 14:33:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 5306 states have (on average 2.142857142857143) internal successors, (11370), 5308 states have internal predecessors, (11370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:07,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 11370 transitions. [2022-11-23 14:33:07,643 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 11370 transitions. Word has length 41 [2022-11-23 14:33:07,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:33:07,643 INFO L495 AbstractCegarLoop]: Abstraction has 5309 states and 11370 transitions. [2022-11-23 14:33:07,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 25 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 11370 transitions. [2022-11-23 14:33:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 14:33:07,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:33:07,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:33:07,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 14:33:07,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:33:07,858 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-11-23 14:33:07,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:33:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash -655897640, now seen corresponding path program 3 times [2022-11-23 14:33:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:33:07,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129103125] [2022-11-23 14:33:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:33:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:33:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:33:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:10,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:33:10,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129103125] [2022-11-23 14:33:10,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129103125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:33:10,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255834190] [2022-11-23 14:33:10,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:33:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:33:10,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:33:10,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:33:10,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0096bda-411b-4cc4-aa0f-e0a2daac6157/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 14:33:10,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:33:10,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:33:10,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-23 14:33:10,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:33:10,641 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-23 14:33:10,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-23 14:33:11,650 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-11-23 14:33:12,368 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 51 treesize of output 46 [2022-11-23 14:33:12,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:33:12,696 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-11-23 14:33:14,268 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-11-23 14:33:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:40,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:33:42,053 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret34#1_164| Int) (v_ArrVal_1311 (Array Int Int)) (v_ArrVal_1312 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret34#1_164| c_~top~0) (not (= 4294967294 (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1311))) (store .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select .cse0 |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_164| 4)) v_ArrVal_1312))) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) is different from false [2022-11-23 14:33:42,588 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret34#1_164| Int) (v_ArrVal_1311 (Array Int Int)) (v_ArrVal_1312 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_92| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret34#1_164| (+ c_~top~0 1)) (not (= 4294967294 (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1311) |c_~#arr~0.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_92| (* |v_t1Thread1of1ForFork0_push_#t~ret34#1_164| 4)) v_ArrVal_1312) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_92| |c_~#arr~0.offset|))) is different from false [2022-11-23 14:33:42,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:42,612 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 36 treesize of output 37 [2022-11-23 14:33:42,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:42,629 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 63 treesize of output 67 [2022-11-23 14:33:42,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:33:42,638 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 41 treesize of output 35 [2022-11-23 14:33:42,653 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 10 treesize of output 4 [2022-11-23 14:33:42,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:33:42,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:42,677 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 43 treesize of output 47 [2022-11-23 14:33:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 22 refuted. 7 times theorem prover too weak. 9 trivial. 6 not checked. [2022-11-23 14:33:45,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255834190] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:33:45,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1784879073] [2022-11-23 14:33:45,361 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:336) 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-11-23 14:33:45,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 14:33:45,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 20] total 72 [2022-11-23 14:33:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038503307] [2022-11-23 14:33:45,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 14:33:45,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-23 14:33:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:33:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-23 14:33:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=4804, Unknown=24, NotChecked=282, Total=5402 [2022-11-23 14:33:45,365 INFO L87 Difference]: Start difference. First operand 5309 states and 11370 transitions. Second operand has 74 states, 73 states have (on average 1.9589041095890412) internal successors, (143), 73 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:46,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:33:57,539 WARN L233 SmtUtils]: Spent 10.40s on a formula simplification. DAG size of input: 93 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:34:00,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:34:08,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:09,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:12,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:14,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:16,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:18,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:19,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:21,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:24,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:26,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:28,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:30,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:32,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:36,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:38,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:40,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:42,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:45,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, 1] [2022-11-23 14:34:48,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:49,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:51,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:34:53,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:55,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:34:57,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:01,790 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-11-23 14:35:04,091 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-11-23 14:35:05,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:35:07,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:35:08,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:10,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:11,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:17,235 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-11-23 14:35:19,549 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-11-23 14:35:21,610 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-11-23 14:35:23,662 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-11-23 14:35:26,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:35:29,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:31,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:35,532 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-11-23 14:35:40,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:41,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:45,093 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-11-23 14:35:46,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:49,084 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-11-23 14:35:51,705 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-11-23 14:35:54,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:56,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:35:59,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:36:01,930 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-11-23 14:36:04,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:36:06,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:36:08,970 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-11-23 14:36:11,320 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-11-23 14:36:13,375 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-11-23 14:36:15,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:36:18,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:36:22,807 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-11-23 14:36:24,851 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-11-23 14:36:28,602 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, 1] [2022-11-23 14:36:33,621 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-11-23 14:36:35,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-11-23 14:36:37,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:36:40,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:36:42,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:36:44,726 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-11-23 14:36:47,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:36:49,927 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-11-23 14:36:51,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:36:55,916 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-11-23 14:36:58,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:37:00,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:37:02,973 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-11-23 14:37:05,050 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-11-23 14:37:06,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:37:09,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:37:11,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:37:13,009 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-11-23 14:37:24,611 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-11-23 14:37:27,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:37:42,097 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-11-23 14:37:44,656 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-11-23 14:37:47,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:37:52,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:37:56,650 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-11-23 14:37:59,362 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-11-23 14:38:01,413 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-11-23 14:38:06,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:38:09,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:38:16,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:38:18,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:38:20,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:38:23,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 14:38:27,291 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-11-23 14:38:29,471 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]