./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:53:48,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:53:48,927 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:53:48,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:53:48,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:53:48,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:53:48,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:53:48,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:53:48,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:53:48,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:53:48,967 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:53:48,967 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:53:48,967 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:53:48,967 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:53:48,967 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:53:48,968 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:53:48,968 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:53:48,968 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:53:48,968 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:53:48,968 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:53:48,968 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:53:48,969 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:53:48,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:53:48,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:53:48,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:53:48,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:53:48,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:53:48,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:53:48,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:53:48,970 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:53:48,971 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:53:48,971 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:53:48,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:53:48,971 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:53:48,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:53:48,972 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:53:48,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:53:48,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:53:48,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:53:48,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:53:48,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:53:48,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:48,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:53:48,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:53:48,973 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:53:48,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:53:48,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:53:48,974 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:53:48,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:53:48,974 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-11-14 03:53:49,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:53:49,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:53:49,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:53:49,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:53:49,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:53:49,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c Unable to find full path for "g++" [2024-11-14 03:53:51,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:53:52,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:53:52,058 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-11-14 03:53:52,068 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data/08f010d9c/a7b0a215b58c4c87b08cc923e2c94df9/FLAG9b1bc7607 [2024-11-14 03:53:52,091 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data/08f010d9c/a7b0a215b58c4c87b08cc923e2c94df9 [2024-11-14 03:53:52,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:53:52,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:53:52,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:52,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:53:52,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:53:52,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35014352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52, skipping insertion in model container [2024-11-14 03:53:52,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:53:52,393 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:53:52,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:52,409 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:53:52,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:53:52,487 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:53:52,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52 WrapperNode [2024-11-14 03:53:52,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:53:52,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:52,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:53:52,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:53:52,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,560 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 214 [2024-11-14 03:53:52,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:53:52,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:53:52,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:53:52,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:53:52,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,585 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:53:52,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:53:52,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:53:52,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:53:52,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (1/1) ... [2024-11-14 03:53:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:53:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:52,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:53:52,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:53:52,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:53:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 03:53:52,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 03:53:52,725 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 03:53:52,725 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 03:53:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-14 03:53:52,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-14 03:53:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:53:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:53:52,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:53:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:53:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:53:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:53:52,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:53:52,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:53:52,730 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:53:52,899 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:53:52,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:53:53,547 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:53:53,547 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:53:54,025 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:53:54,026 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 03:53:54,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:54 BoogieIcfgContainer [2024-11-14 03:53:54,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:53:54,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:53:54,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:53:54,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:53:54,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:53:52" (1/3) ... [2024-11-14 03:53:54,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b0b922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:54, skipping insertion in model container [2024-11-14 03:53:54,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:53:52" (2/3) ... [2024-11-14 03:53:54,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b0b922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:53:54, skipping insertion in model container [2024-11-14 03:53:54,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:53:54" (3/3) ... [2024-11-14 03:53:54,039 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-11-14 03:53:54,061 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:53:54,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2024-11-14 03:53:54,064 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:53:54,209 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-14 03:53:54,260 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 58 transitions, 137 flow [2024-11-14 03:53:54,628 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3069 states, 2891 states have (on average 3.8135593220338984) internal successors, (11025), 3068 states have internal predecessors, (11025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:54,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:53:54,689 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@82e57c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:53:54,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-14 03:53:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 3069 states, 2891 states have (on average 3.8135593220338984) internal successors, (11025), 3068 states have internal predecessors, (11025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:53:54,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:54,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:53:54,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:53:54,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 721660, now seen corresponding path program 1 times [2024-11-14 03:53:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112877445] [2024-11-14 03:53:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:55,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:55,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112877445] [2024-11-14 03:53:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112877445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:55,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:53:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466968719] [2024-11-14 03:53:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:55,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:55,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:55,113 INFO L87 Difference]: Start difference. First operand has 3069 states, 2891 states have (on average 3.8135593220338984) internal successors, (11025), 3068 states have internal predecessors, (11025), 0 states have call successors, (0), 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 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) [2024-11-14 03:53:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:55,404 INFO L93 Difference]: Finished difference Result 3069 states and 11025 transitions. [2024-11-14 03:53:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:55,406 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 [2024-11-14 03:53:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:55,478 INFO L225 Difference]: With dead ends: 3069 [2024-11-14 03:53:55,478 INFO L226 Difference]: Without dead ends: 2050 [2024-11-14 03:53:55,492 INFO L431 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 [2024-11-14 03:53:55,500 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:55,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2024-11-14 03:53:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2024-11-14 03:53:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1974 states have (on average 3.7051671732522795) internal successors, (7314), 2049 states have internal predecessors, (7314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 7314 transitions. [2024-11-14 03:53:55,761 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 7314 transitions. Word has length 3 [2024-11-14 03:53:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:55,762 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 7314 transitions. [2024-11-14 03:53:55,764 INFO L472 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) [2024-11-14 03:53:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 7314 transitions. [2024-11-14 03:53:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:53:55,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:55,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:53:55,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:53:55,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:53:55,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash 721661, now seen corresponding path program 1 times [2024-11-14 03:53:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795681885] [2024-11-14 03:53:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:56,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:56,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795681885] [2024-11-14 03:53:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795681885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:56,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:56,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969001358] [2024-11-14 03:53:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:56,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:53:56,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:56,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:53:56,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:53:56,304 INFO L87 Difference]: Start difference. First operand 2050 states and 7314 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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) [2024-11-14 03:53:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:56,577 INFO L93 Difference]: Finished difference Result 2053 states and 7318 transitions. [2024-11-14 03:53:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:53:56,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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 [2024-11-14 03:53:56,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:56,609 INFO L225 Difference]: With dead ends: 2053 [2024-11-14 03:53:56,609 INFO L226 Difference]: Without dead ends: 2052 [2024-11-14 03:53:56,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:53:56,614 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:56,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:53:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2024-11-14 03:53:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052. [2024-11-14 03:53:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1976 states have (on average 3.702935222672065) internal successors, (7317), 2051 states have internal predecessors, (7317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 7317 transitions. [2024-11-14 03:53:56,773 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 7317 transitions. Word has length 3 [2024-11-14 03:53:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:56,774 INFO L471 AbstractCegarLoop]: Abstraction has 2052 states and 7317 transitions. [2024-11-14 03:53:56,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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) [2024-11-14 03:53:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 7317 transitions. [2024-11-14 03:53:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:53:56,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:56,776 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2024-11-14 03:53:56,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:53:56,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:53:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 693539235, now seen corresponding path program 1 times [2024-11-14 03:53:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388010839] [2024-11-14 03:53:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:57,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388010839] [2024-11-14 03:53:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388010839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:53:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200184630] [2024-11-14 03:53:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:57,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:57,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:53:57,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:53:57,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:53:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:57,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:53:57,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:53:57,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-14 03:53:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:58,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:53:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:58,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200184630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:53:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [641174851] [2024-11-14 03:53:58,262 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:53:58,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:53:58,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-14 03:53:58,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599463672] [2024-11-14 03:53:58,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:53:58,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:53:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:58,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:53:58,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:53:58,268 INFO L87 Difference]: Start difference. First operand 2052 states and 7317 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:58,855 INFO L93 Difference]: Finished difference Result 2054 states and 7321 transitions. [2024-11-14 03:53:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:53:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 03:53:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:58,878 INFO L225 Difference]: With dead ends: 2054 [2024-11-14 03:53:58,878 INFO L226 Difference]: Without dead ends: 2053 [2024-11-14 03:53:58,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:53:58,881 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:58,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:53:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2024-11-14 03:53:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2049. [2024-11-14 03:53:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2049 states, 1974 states have (on average 3.704660587639311) internal successors, (7313), 2048 states have internal predecessors, (7313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:58,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 7313 transitions. [2024-11-14 03:53:58,994 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 7313 transitions. Word has length 5 [2024-11-14 03:53:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:58,995 INFO L471 AbstractCegarLoop]: Abstraction has 2049 states and 7313 transitions. [2024-11-14 03:53:58,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 7313 transitions. [2024-11-14 03:53:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:53:58,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:58,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:53:59,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:53:59,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:53:59,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:53:59,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash 28140501, now seen corresponding path program 1 times [2024-11-14 03:53:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:59,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232105132] [2024-11-14 03:53:59,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:53:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:59,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:53:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232105132] [2024-11-14 03:53:59,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232105132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:53:59,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:53:59,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:53:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85731207] [2024-11-14 03:53:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:53:59,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:53:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:53:59,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:53:59,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:53:59,356 INFO L87 Difference]: Start difference. First operand 2049 states and 7313 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:53:59,517 INFO L93 Difference]: Finished difference Result 4097 states and 14625 transitions. [2024-11-14 03:53:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:53:59,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:53:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:53:59,544 INFO L225 Difference]: With dead ends: 4097 [2024-11-14 03:53:59,545 INFO L226 Difference]: Without dead ends: 2051 [2024-11-14 03:53:59,550 INFO L431 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 [2024-11-14 03:53:59,551 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:53:59,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:53:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2024-11-14 03:53:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2050. [2024-11-14 03:53:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1975 states have (on average 3.7032911392405063) internal successors, (7314), 2049 states have internal predecessors, (7314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 7314 transitions. [2024-11-14 03:53:59,716 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 7314 transitions. Word has length 6 [2024-11-14 03:53:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:53:59,717 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 7314 transitions. [2024-11-14 03:53:59,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:53:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 7314 transitions. [2024-11-14 03:53:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:53:59,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:53:59,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:53:59,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:53:59,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:53:59,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:53:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1856337041, now seen corresponding path program 1 times [2024-11-14 03:53:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:53:59,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944487743] [2024-11-14 03:53:59,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:53:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:53:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:00,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:00,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944487743] [2024-11-14 03:54:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944487743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522277307] [2024-11-14 03:54:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:00,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:00,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:00,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:00,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:54:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:00,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:54:00,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:00,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:00,276 INFO L378 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 22 treesize of output 18 [2024-11-14 03:54:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522277307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:00,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [754607002] [2024-11-14 03:54:00,302 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:00,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:00,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-14 03:54:00,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002644101] [2024-11-14 03:54:00,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:00,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:54:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:00,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:54:00,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:54:00,308 INFO L87 Difference]: Start difference. First operand 2050 states and 7314 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:00,816 INFO L93 Difference]: Finished difference Result 3475 states and 12849 transitions. [2024-11-14 03:54:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:54:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 8 [2024-11-14 03:54:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:00,855 INFO L225 Difference]: With dead ends: 3475 [2024-11-14 03:54:00,855 INFO L226 Difference]: Without dead ends: 3119 [2024-11-14 03:54:00,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:54:00,859 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:00,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 36 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:54:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2024-11-14 03:54:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 2228. [2024-11-14 03:54:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2168 states have (on average 3.8261070110701105) internal successors, (8295), 2227 states have internal predecessors, (8295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 8295 transitions. [2024-11-14 03:54:00,991 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 8295 transitions. Word has length 8 [2024-11-14 03:54:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:00,994 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 8295 transitions. [2024-11-14 03:54:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 8295 transitions. [2024-11-14 03:54:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:54:00,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:00,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:01,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:54:01,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:01,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:01,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1856337042, now seen corresponding path program 1 times [2024-11-14 03:54:01,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:01,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394144749] [2024-11-14 03:54:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:01,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394144749] [2024-11-14 03:54:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394144749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:54:01,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:54:01,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:54:01,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63723102] [2024-11-14 03:54:01,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:54:01,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:54:01,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:01,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:54:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:54:01,301 INFO L87 Difference]: Start difference. First operand 2228 states and 8295 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:01,437 INFO L93 Difference]: Finished difference Result 2228 states and 8295 transitions. [2024-11-14 03:54:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:54:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-14 03:54:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:01,457 INFO L225 Difference]: With dead ends: 2228 [2024-11-14 03:54:01,457 INFO L226 Difference]: Without dead ends: 1348 [2024-11-14 03:54:01,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:54:01,460 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:01,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:54:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-11-14 03:54:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1348. [2024-11-14 03:54:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1336 states have (on average 3.7013473053892216) internal successors, (4945), 1347 states have internal predecessors, (4945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 4945 transitions. [2024-11-14 03:54:01,526 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 4945 transitions. Word has length 8 [2024-11-14 03:54:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:01,526 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 4945 transitions. [2024-11-14 03:54:01,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 4945 transitions. [2024-11-14 03:54:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:54:01,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:01,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:01,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:54:01,527 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1534782513, now seen corresponding path program 1 times [2024-11-14 03:54:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694645282] [2024-11-14 03:54:01,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:01,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694645282] [2024-11-14 03:54:01,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694645282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:01,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147344611] [2024-11-14 03:54:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:01,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:01,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:54:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:01,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:54:01,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:01,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147344611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1941109392] [2024-11-14 03:54:02,091 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:02,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:02,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-14 03:54:02,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627768363] [2024-11-14 03:54:02,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:54:02,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:02,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:54:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:54:02,095 INFO L87 Difference]: Start difference. First operand 1348 states and 4945 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:02,528 INFO L93 Difference]: Finished difference Result 2996 states and 10956 transitions. [2024-11-14 03:54:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:54:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 [2024-11-14 03:54:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:02,549 INFO L225 Difference]: With dead ends: 2996 [2024-11-14 03:54:02,549 INFO L226 Difference]: Without dead ends: 1819 [2024-11-14 03:54:02,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:54:02,553 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 121 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:02,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 50 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:54:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2024-11-14 03:54:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1663. [2024-11-14 03:54:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1651 states have (on average 3.661417322834646) internal successors, (6045), 1662 states have internal predecessors, (6045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 6045 transitions. [2024-11-14 03:54:02,637 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 6045 transitions. Word has length 10 [2024-11-14 03:54:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:02,638 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 6045 transitions. [2024-11-14 03:54:02,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 6045 transitions. [2024-11-14 03:54:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:54:02,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:02,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:02,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:54:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:02,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1010770327, now seen corresponding path program 2 times [2024-11-14 03:54:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67160803] [2024-11-14 03:54:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:03,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67160803] [2024-11-14 03:54:03,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67160803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827615562] [2024-11-14 03:54:03,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:54:03,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:03,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:03,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:03,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:54:03,369 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 03:54:03,369 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:54:03,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 03:54:03,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:03,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:54:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:54:03,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:54:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827615562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:54:03,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:54:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2024-11-14 03:54:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568743590] [2024-11-14 03:54:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:54:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:54:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:03,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:54:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:54:03,730 INFO L87 Difference]: Start difference. First operand 1663 states and 6045 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2024-11-14 03:54:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:04,103 INFO L93 Difference]: Finished difference Result 2685 states and 10019 transitions. [2024-11-14 03:54:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:54:04,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 12 [2024-11-14 03:54:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:04,137 INFO L225 Difference]: With dead ends: 2685 [2024-11-14 03:54:04,137 INFO L226 Difference]: Without dead ends: 2393 [2024-11-14 03:54:04,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:54:04,141 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:04,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 29 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:54:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2024-11-14 03:54:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2247. [2024-11-14 03:54:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 2235 states have (on average 3.7767337807606265) internal successors, (8441), 2246 states have internal predecessors, (8441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 8441 transitions. [2024-11-14 03:54:04,275 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 8441 transitions. Word has length 12 [2024-11-14 03:54:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:04,276 INFO L471 AbstractCegarLoop]: Abstraction has 2247 states and 8441 transitions. [2024-11-14 03:54:04,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2024-11-14 03:54:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 8441 transitions. [2024-11-14 03:54:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:54:04,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:04,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:04,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:54:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:04,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1782835489, now seen corresponding path program 1 times [2024-11-14 03:54:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121496117] [2024-11-14 03:54:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:04,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:04,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121496117] [2024-11-14 03:54:04,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121496117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:54:04,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:54:04,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:54:04,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191010946] [2024-11-14 03:54:04,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:54:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:54:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:04,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:54:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:54:04,836 INFO L87 Difference]: Start difference. First operand 2247 states and 8441 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:05,211 INFO L93 Difference]: Finished difference Result 3195 states and 12417 transitions. [2024-11-14 03:54:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:54:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 03:54:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:05,244 INFO L225 Difference]: With dead ends: 3195 [2024-11-14 03:54:05,244 INFO L226 Difference]: Without dead ends: 2879 [2024-11-14 03:54:05,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:54:05,250 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 58 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:05,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 21 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:54:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2024-11-14 03:54:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2879. [2024-11-14 03:54:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2867 states have (on average 3.9054761074293687) internal successors, (11197), 2878 states have internal predecessors, (11197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 11197 transitions. [2024-11-14 03:54:05,380 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 11197 transitions. Word has length 12 [2024-11-14 03:54:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:05,380 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 11197 transitions. [2024-11-14 03:54:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 11197 transitions. [2024-11-14 03:54:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:54:05,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:05,384 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:05,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:54:05,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:05,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash 44204663, now seen corresponding path program 1 times [2024-11-14 03:54:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157177981] [2024-11-14 03:54:05,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:05,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:05,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157177981] [2024-11-14 03:54:05,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157177981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:05,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031491352] [2024-11-14 03:54:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:05,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:05,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:05,542 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:05,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:54:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:05,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 03:54:05,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:05,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031491352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [952064165] [2024-11-14 03:54:05,850 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:05,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 03:54:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771431028] [2024-11-14 03:54:05,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:54:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:05,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:54:05,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:54:05,852 INFO L87 Difference]: Start difference. First operand 2879 states and 11197 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:06,267 INFO L93 Difference]: Finished difference Result 3394 states and 12764 transitions. [2024-11-14 03:54:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:54:06,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 03:54:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:06,295 INFO L225 Difference]: With dead ends: 3394 [2024-11-14 03:54:06,295 INFO L226 Difference]: Without dead ends: 2967 [2024-11-14 03:54:06,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:54:06,299 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 88 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:06,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 50 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:54:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-11-14 03:54:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2929. [2024-11-14 03:54:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2917 states have (on average 3.857730545080562) internal successors, (11253), 2928 states have internal predecessors, (11253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 11253 transitions. [2024-11-14 03:54:06,486 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 11253 transitions. Word has length 12 [2024-11-14 03:54:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:06,486 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 11253 transitions. [2024-11-14 03:54:06,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 11253 transitions. [2024-11-14 03:54:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:54:06,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:06,492 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:06,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:54:06,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:06,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:06,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1108741777, now seen corresponding path program 2 times [2024-11-14 03:54:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215068120] [2024-11-14 03:54:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:06,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:07,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:07,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215068120] [2024-11-14 03:54:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215068120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:07,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843396406] [2024-11-14 03:54:07,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:54:07,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:07,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:07,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:07,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:54:07,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:54:07,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:54:07,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 03:54:07,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:54:07,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:07,778 INFO L378 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 35 treesize of output 31 [2024-11-14 03:54:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:54:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843396406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1109112042] [2024-11-14 03:54:07,879 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:07,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:07,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-14 03:54:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817394392] [2024-11-14 03:54:07,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:07,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:54:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:07,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:54:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:54:07,886 INFO L87 Difference]: Start difference. First operand 2929 states and 11253 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:10,081 INFO L93 Difference]: Finished difference Result 4262 states and 16374 transitions. [2024-11-14 03:54:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:54:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 03:54:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:10,155 INFO L225 Difference]: With dead ends: 4262 [2024-11-14 03:54:10,155 INFO L226 Difference]: Without dead ends: 4026 [2024-11-14 03:54:10,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:54:10,161 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 265 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:10,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 141 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 03:54:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2024-11-14 03:54:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 2221. [2024-11-14 03:54:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 2215 states have (on average 3.768397291196388) internal successors, (8347), 2220 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 8347 transitions. [2024-11-14 03:54:10,270 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 8347 transitions. Word has length 14 [2024-11-14 03:54:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:10,271 INFO L471 AbstractCegarLoop]: Abstraction has 2221 states and 8347 transitions. [2024-11-14 03:54:10,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 8347 transitions. [2024-11-14 03:54:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:54:10,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:10,273 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:10,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-14 03:54:10,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 03:54:10,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:10,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -885561155, now seen corresponding path program 1 times [2024-11-14 03:54:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:10,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634052190] [2024-11-14 03:54:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:10,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:10,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634052190] [2024-11-14 03:54:10,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634052190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394289976] [2024-11-14 03:54:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:10,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:10,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:10,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:54:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:10,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 03:54:10,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:11,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394289976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369662633] [2024-11-14 03:54:11,109 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:11,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:11,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-14 03:54:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387895558] [2024-11-14 03:54:11,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:54:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:11,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:54:11,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:54:11,111 INFO L87 Difference]: Start difference. First operand 2221 states and 8347 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:11,506 INFO L93 Difference]: Finished difference Result 2418 states and 8920 transitions. [2024-11-14 03:54:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:54:11,507 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:54:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:11,526 INFO L225 Difference]: With dead ends: 2418 [2024-11-14 03:54:11,526 INFO L226 Difference]: Without dead ends: 2155 [2024-11-14 03:54:11,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:54:11,529 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 75 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:11,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 53 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:54:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2024-11-14 03:54:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2147. [2024-11-14 03:54:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 2141 states have (on average 3.744978981784213) internal successors, (8018), 2146 states have internal predecessors, (8018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8018 transitions. [2024-11-14 03:54:11,612 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8018 transitions. Word has length 15 [2024-11-14 03:54:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:11,613 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 8018 transitions. [2024-11-14 03:54:11,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8018 transitions. [2024-11-14 03:54:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:54:11,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:11,615 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:11,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-14 03:54:11,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 03:54:11,819 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:11,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash 592997233, now seen corresponding path program 1 times [2024-11-14 03:54:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515857351] [2024-11-14 03:54:11,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:12,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515857351] [2024-11-14 03:54:12,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515857351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:12,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031549332] [2024-11-14 03:54:12,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:12,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:12,014 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:12,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:54:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:12,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:54:12,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:12,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031549332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1512927353] [2024-11-14 03:54:12,461 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:12,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:12,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-14 03:54:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962171653] [2024-11-14 03:54:12,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:54:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:54:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:54:12,464 INFO L87 Difference]: Start difference. First operand 2147 states and 8018 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:13,013 INFO L93 Difference]: Finished difference Result 4331 states and 16351 transitions. [2024-11-14 03:54:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:54:13,015 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 03:54:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:13,039 INFO L225 Difference]: With dead ends: 4331 [2024-11-14 03:54:13,039 INFO L226 Difference]: Without dead ends: 3248 [2024-11-14 03:54:13,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-11-14 03:54:13,043 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 189 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:13,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 52 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:54:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2024-11-14 03:54:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3099. [2024-11-14 03:54:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 3093 states have (on average 3.7995473650177822) internal successors, (11752), 3098 states have internal predecessors, (11752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 11752 transitions. [2024-11-14 03:54:13,158 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 11752 transitions. Word has length 16 [2024-11-14 03:54:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:13,158 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 11752 transitions. [2024-11-14 03:54:13,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 11752 transitions. [2024-11-14 03:54:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:54:13,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:13,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:13,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:54:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 03:54:13,367 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:13,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1298911645, now seen corresponding path program 2 times [2024-11-14 03:54:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974366360] [2024-11-14 03:54:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:54:13,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974366360] [2024-11-14 03:54:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974366360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219451602] [2024-11-14 03:54:13,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:54:13,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:13,760 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:13,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:54:13,881 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:54:13,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:54:13,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:54:13,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:54:14,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:14,513 INFO L378 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 35 treesize of output 31 [2024-11-14 03:54:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:54:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219451602] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1818591343] [2024-11-14 03:54:14,588 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:14,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:14,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-11-14 03:54:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408967031] [2024-11-14 03:54:14,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:14,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:54:14,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:14,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:54:14,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:54:14,591 INFO L87 Difference]: Start difference. First operand 3099 states and 11752 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 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) [2024-11-14 03:54:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:15,343 INFO L93 Difference]: Finished difference Result 3400 states and 12909 transitions. [2024-11-14 03:54:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:54:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 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 17 [2024-11-14 03:54:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:15,365 INFO L225 Difference]: With dead ends: 3400 [2024-11-14 03:54:15,366 INFO L226 Difference]: Without dead ends: 3099 [2024-11-14 03:54:15,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-11-14 03:54:15,369 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 216 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:15,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 71 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:54:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2024-11-14 03:54:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 2196. [2024-11-14 03:54:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 2193 states have (on average 3.6388508891928866) internal successors, (7980), 2195 states have internal predecessors, (7980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 7980 transitions. [2024-11-14 03:54:15,450 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 7980 transitions. Word has length 17 [2024-11-14 03:54:15,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:15,451 INFO L471 AbstractCegarLoop]: Abstraction has 2196 states and 7980 transitions. [2024-11-14 03:54:15,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 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) [2024-11-14 03:54:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 7980 transitions. [2024-11-14 03:54:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:54:15,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:15,455 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:15,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 03:54:15,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 03:54:15,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:15,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 664033931, now seen corresponding path program 2 times [2024-11-14 03:54:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605066866] [2024-11-14 03:54:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:16,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605066866] [2024-11-14 03:54:16,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605066866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:16,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776132364] [2024-11-14 03:54:16,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:54:16,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:16,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:16,004 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:16,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:54:16,124 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:54:16,125 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:54:16,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 03:54:16,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:16,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:54:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:54:16,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 03:54:16,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776132364] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:16,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2075714379] [2024-11-14 03:54:16,978 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:16,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:16,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2024-11-14 03:54:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155595355] [2024-11-14 03:54:16,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:16,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:54:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:54:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-11-14 03:54:16,982 INFO L87 Difference]: Start difference. First operand 2196 states and 7980 transitions. Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:18,341 INFO L93 Difference]: Finished difference Result 2475 states and 8941 transitions. [2024-11-14 03:54:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:54:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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 [2024-11-14 03:54:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:18,361 INFO L225 Difference]: With dead ends: 2475 [2024-11-14 03:54:18,361 INFO L226 Difference]: Without dead ends: 2297 [2024-11-14 03:54:18,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-11-14 03:54:18,366 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 258 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:18,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 205 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:54:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-11-14 03:54:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1662. [2024-11-14 03:54:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 3.562913907284768) internal successors, (5918), 1661 states have internal predecessors, (5918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:18,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 5918 transitions. [2024-11-14 03:54:18,442 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 5918 transitions. Word has length 18 [2024-11-14 03:54:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:18,443 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 5918 transitions. [2024-11-14 03:54:18,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 5918 transitions. [2024-11-14 03:54:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:54:18,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:18,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:54:18,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-14 03:54:18,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:54:18,655 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:18,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:18,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1212021102, now seen corresponding path program 1 times [2024-11-14 03:54:18,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:18,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043152715] [2024-11-14 03:54:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:54:18,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043152715] [2024-11-14 03:54:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043152715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:54:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:54:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:54:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475906761] [2024-11-14 03:54:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:54:18,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:54:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:54:18,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:54:18,732 INFO L87 Difference]: Start difference. First operand 1662 states and 5918 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2024-11-14 03:54:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:18,865 INFO L93 Difference]: Finished difference Result 2132 states and 7635 transitions. [2024-11-14 03:54:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:54:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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 [2024-11-14 03:54:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:18,883 INFO L225 Difference]: With dead ends: 2132 [2024-11-14 03:54:18,883 INFO L226 Difference]: Without dead ends: 1873 [2024-11-14 03:54:18,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:54:18,886 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 48 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:18,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:54:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-14 03:54:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1873. [2024-11-14 03:54:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 3.5625) internal successors, (6669), 1872 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 6669 transitions. [2024-11-14 03:54:18,951 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 6669 transitions. Word has length 21 [2024-11-14 03:54:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:18,952 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 6669 transitions. [2024-11-14 03:54:18,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2024-11-14 03:54:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 6669 transitions. [2024-11-14 03:54:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:54:18,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:18,959 INFO L215 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, 1] [2024-11-14 03:54:18,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:54:18,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:18,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:18,961 INFO L85 PathProgramCache]: Analyzing trace with hash 481210620, now seen corresponding path program 1 times [2024-11-14 03:54:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:18,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356746172] [2024-11-14 03:54:18,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:19,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356746172] [2024-11-14 03:54:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356746172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449242582] [2024-11-14 03:54:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:19,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:19,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:19,128 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:19,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:54:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:19,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:54:19,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:19,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:19,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449242582] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:19,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:54:19,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2024-11-14 03:54:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092309692] [2024-11-14 03:54:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:54:19,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:54:19,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:54:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:54:19,392 INFO L87 Difference]: Start difference. First operand 1873 states and 6669 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:19,534 INFO L93 Difference]: Finished difference Result 2427 states and 8530 transitions. [2024-11-14 03:54:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:54:19,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 03:54:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:19,552 INFO L225 Difference]: With dead ends: 2427 [2024-11-14 03:54:19,552 INFO L226 Difference]: Without dead ends: 2073 [2024-11-14 03:54:19,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:54:19,555 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:19,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 9 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:54:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2024-11-14 03:54:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 2073. [2024-11-14 03:54:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 3.5458494208494207) internal successors, (7347), 2072 states have internal predecessors, (7347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 7347 transitions. [2024-11-14 03:54:19,633 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 7347 transitions. Word has length 24 [2024-11-14 03:54:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 7347 transitions. [2024-11-14 03:54:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 7347 transitions. [2024-11-14 03:54:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:54:19,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:19,644 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:54:19,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 03:54:19,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 03:54:19,845 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:19,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1597013884, now seen corresponding path program 1 times [2024-11-14 03:54:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:19,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536477270] [2024-11-14 03:54:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:20,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536477270] [2024-11-14 03:54:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536477270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431466826] [2024-11-14 03:54:20,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:20,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:20,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:20,802 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:20,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:54:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:20,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:54:20,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:21,038 INFO L378 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 15 treesize of output 1 [2024-11-14 03:54:21,391 INFO L378 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 55 treesize of output 53 [2024-11-14 03:54:21,401 INFO L378 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 53 treesize of output 51 [2024-11-14 03:54:21,533 INFO L378 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 33 treesize of output 21 [2024-11-14 03:54:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:21,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:22,201 INFO L378 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 79 treesize of output 77 [2024-11-14 03:54:22,212 INFO L378 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 77 treesize of output 75 [2024-11-14 03:54:23,247 INFO L378 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 183 treesize of output 169 [2024-11-14 03:54:23,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:23,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2024-11-14 03:54:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:29,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431466826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:29,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [662145043] [2024-11-14 03:54:29,762 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:29,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:29,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:54:29,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910896724] [2024-11-14 03:54:29,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:29,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:54:29,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:54:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:54:29,768 INFO L87 Difference]: Start difference. First operand 2073 states and 7347 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:34,561 INFO L93 Difference]: Finished difference Result 3590 states and 12519 transitions. [2024-11-14 03:54:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-14 03:54:34,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:54:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:34,582 INFO L225 Difference]: With dead ends: 3590 [2024-11-14 03:54:34,582 INFO L226 Difference]: Without dead ends: 3521 [2024-11-14 03:54:34,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=544, Invalid=2878, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 03:54:34,586 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 438 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2027 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:34,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 141 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2027 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 03:54:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2024-11-14 03:54:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2151. [2024-11-14 03:54:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2151 states, 2150 states have (on average 3.523720930232558) internal successors, (7576), 2150 states have internal predecessors, (7576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 7576 transitions. [2024-11-14 03:54:34,668 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 7576 transitions. Word has length 28 [2024-11-14 03:54:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:34,668 INFO L471 AbstractCegarLoop]: Abstraction has 2151 states and 7576 transitions. [2024-11-14 03:54:34,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 7576 transitions. [2024-11-14 03:54:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:54:34,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:34,678 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:54:34,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-14 03:54:34,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 03:54:34,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:34,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:34,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1476003340, now seen corresponding path program 2 times [2024-11-14 03:54:34,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:34,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821953022] [2024-11-14 03:54:34,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:34,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:35,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:35,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821953022] [2024-11-14 03:54:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821953022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:35,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84627637] [2024-11-14 03:54:36,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:54:36,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:36,002 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:36,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:54:36,141 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:54:36,141 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:54:36,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:54:36,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:36,236 INFO L378 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 15 treesize of output 1 [2024-11-14 03:54:36,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:36,977 INFO L378 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 79 treesize of output 59 [2024-11-14 03:54:36,983 INFO L378 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 42 treesize of output 40 [2024-11-14 03:54:36,989 INFO L378 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 40 treesize of output 38 [2024-11-14 03:54:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:37,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:37,432 INFO L378 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 79 treesize of output 77 [2024-11-14 03:54:37,440 INFO L378 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 77 treesize of output 75 [2024-11-14 03:54:38,585 INFO L378 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 108 treesize of output 96 [2024-11-14 03:54:38,593 INFO L378 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 144 treesize of output 132 [2024-11-14 03:54:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84627637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:54:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1001255149] [2024-11-14 03:54:38,768 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:54:38,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:54:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2024-11-14 03:54:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874530639] [2024-11-14 03:54:38,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:54:38,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 03:54:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:54:38,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 03:54:38,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2024-11-14 03:54:38,770 INFO L87 Difference]: Start difference. First operand 2151 states and 7576 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:54:49,585 INFO L93 Difference]: Finished difference Result 11350 states and 41816 transitions. [2024-11-14 03:54:49,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-14 03:54:49,586 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:54:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:54:49,652 INFO L225 Difference]: With dead ends: 11350 [2024-11-14 03:54:49,652 INFO L226 Difference]: Without dead ends: 11257 [2024-11-14 03:54:49,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1628, Invalid=7114, Unknown=0, NotChecked=0, Total=8742 [2024-11-14 03:54:49,661 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 829 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 3592 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 3683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:54:49,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 319 Invalid, 3683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3592 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-14 03:54:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11257 states. [2024-11-14 03:54:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11257 to 2483. [2024-11-14 03:54:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2482 states have (on average 3.5572119258662367) internal successors, (8829), 2482 states have internal predecessors, (8829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 8829 transitions. [2024-11-14 03:54:49,864 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 8829 transitions. Word has length 28 [2024-11-14 03:54:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:54:49,864 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 8829 transitions. [2024-11-14 03:54:49,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:54:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 8829 transitions. [2024-11-14 03:54:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:54:49,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:54:49,874 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:54:49,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 03:54:50,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:50,077 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:54:50,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:54:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2132576632, now seen corresponding path program 3 times [2024-11-14 03:54:50,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:54:50,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450225220] [2024-11-14 03:54:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:54:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:54:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:54:50,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:50,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:54:50,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450225220] [2024-11-14 03:54:50,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450225220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:54:50,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411439104] [2024-11-14 03:54:50,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:54:50,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:54:50,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:54:50,911 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:54:50,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 03:54:51,055 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:54:51,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:54:51,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 03:54:51,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:54:51,169 INFO L378 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 15 treesize of output 1 [2024-11-14 03:54:51,703 INFO L378 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 50 treesize of output 48 [2024-11-14 03:54:51,709 INFO L378 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 65 treesize of output 45 [2024-11-14 03:54:51,714 INFO L378 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 36 treesize of output 34 [2024-11-14 03:54:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:54:51,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:54:52,094 INFO L378 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 79 treesize of output 77 [2024-11-14 03:54:52,103 INFO L378 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 77 treesize of output 75 [2024-11-14 03:54:53,543 INFO L378 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 183 treesize of output 169 [2024-11-14 03:54:53,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:54:53,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2024-11-14 03:55:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:11,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411439104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:55:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2110263499] [2024-11-14 03:55:11,887 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:55:11,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:55:11,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:55:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173706799] [2024-11-14 03:55:11,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:55:11,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:55:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:55:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:55:11,890 INFO L87 Difference]: Start difference. First operand 2483 states and 8829 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:16,006 INFO L93 Difference]: Finished difference Result 3905 states and 13765 transitions. [2024-11-14 03:55:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-14 03:55:16,007 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:55:16,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:16,037 INFO L225 Difference]: With dead ends: 3905 [2024-11-14 03:55:16,037 INFO L226 Difference]: Without dead ends: 3840 [2024-11-14 03:55:16,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=396, Invalid=2154, Unknown=0, NotChecked=0, Total=2550 [2024-11-14 03:55:16,042 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 377 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:16,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 120 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 03:55:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2024-11-14 03:55:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 2465. [2024-11-14 03:55:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2464 states have (on average 3.5625) internal successors, (8778), 2464 states have internal predecessors, (8778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 8778 transitions. [2024-11-14 03:55:16,178 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 8778 transitions. Word has length 28 [2024-11-14 03:55:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:16,179 INFO L471 AbstractCegarLoop]: Abstraction has 2465 states and 8778 transitions. [2024-11-14 03:55:16,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 8778 transitions. [2024-11-14 03:55:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:55:16,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:16,189 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:55:16,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 03:55:16,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:55:16,391 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:55:16,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 943248124, now seen corresponding path program 4 times [2024-11-14 03:55:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:16,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958120833] [2024-11-14 03:55:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:16,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:17,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958120833] [2024-11-14 03:55:17,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958120833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:55:17,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819319639] [2024-11-14 03:55:17,223 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:55:17,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:55:17,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:55:17,225 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:55:17,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 03:55:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:17,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:55:17,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:55:17,469 INFO L378 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 15 treesize of output 1 [2024-11-14 03:55:17,858 INFO L378 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 70 treesize of output 50 [2024-11-14 03:55:17,863 INFO L378 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 43 treesize of output 41 [2024-11-14 03:55:17,869 INFO L378 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 39 [2024-11-14 03:55:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:18,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:55:18,351 INFO L378 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 79 treesize of output 77 [2024-11-14 03:55:18,358 INFO L378 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 77 treesize of output 75 [2024-11-14 03:55:19,341 INFO L378 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 183 treesize of output 169 [2024-11-14 03:55:19,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:55:19,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2024-11-14 03:55:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:26,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819319639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:55:26,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [79924068] [2024-11-14 03:55:26,905 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:55:26,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:55:26,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:55:26,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369006274] [2024-11-14 03:55:26,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:55:26,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:55:26,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:55:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:55:26,907 INFO L87 Difference]: Start difference. First operand 2465 states and 8778 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:32,359 INFO L93 Difference]: Finished difference Result 4341 states and 15299 transitions. [2024-11-14 03:55:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-14 03:55:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:55:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:32,374 INFO L225 Difference]: With dead ends: 4341 [2024-11-14 03:55:32,374 INFO L226 Difference]: Without dead ends: 4272 [2024-11-14 03:55:32,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=526, Invalid=3014, Unknown=0, NotChecked=0, Total=3540 [2024-11-14 03:55:32,377 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 490 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:32,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 137 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 03:55:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2024-11-14 03:55:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 2465. [2024-11-14 03:55:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2464 states have (on average 3.5625) internal successors, (8778), 2464 states have internal predecessors, (8778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 8778 transitions. [2024-11-14 03:55:32,445 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 8778 transitions. Word has length 28 [2024-11-14 03:55:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:32,446 INFO L471 AbstractCegarLoop]: Abstraction has 2465 states and 8778 transitions. [2024-11-14 03:55:32,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 8778 transitions. [2024-11-14 03:55:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:55:32,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:32,452 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:55:32,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 03:55:32,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:55:32,656 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:55:32,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -8214686, now seen corresponding path program 5 times [2024-11-14 03:55:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:32,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197071208] [2024-11-14 03:55:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:33,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197071208] [2024-11-14 03:55:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197071208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:55:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969556532] [2024-11-14 03:55:33,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:55:33,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:55:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:55:33,921 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:55:33,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 03:55:34,054 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:55:34,054 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:55:34,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 03:55:34,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:55:34,154 INFO L378 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 15 treesize of output 1 [2024-11-14 03:55:34,456 INFO L378 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 50 treesize of output 48 [2024-11-14 03:55:34,461 INFO L378 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 48 treesize of output 46 [2024-11-14 03:55:34,623 INFO L378 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 30 treesize of output 18 [2024-11-14 03:55:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:34,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:55:35,195 INFO L378 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 79 treesize of output 77 [2024-11-14 03:55:35,205 INFO L378 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 77 treesize of output 75 [2024-11-14 03:55:36,116 INFO L378 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 183 treesize of output 169 [2024-11-14 03:55:36,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:55:36,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2024-11-14 03:55:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:49,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969556532] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:55:49,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1724667777] [2024-11-14 03:55:49,660 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:55:49,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:55:49,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-14 03:55:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910376838] [2024-11-14 03:55:49,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:55:49,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 03:55:49,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 03:55:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2024-11-14 03:55:49,662 INFO L87 Difference]: Start difference. First operand 2465 states and 8778 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:55:56,386 INFO L93 Difference]: Finished difference Result 8788 states and 32115 transitions. [2024-11-14 03:55:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-14 03:55:56,387 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:55:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:55:56,426 INFO L225 Difference]: With dead ends: 8788 [2024-11-14 03:55:56,426 INFO L226 Difference]: Without dead ends: 8714 [2024-11-14 03:55:56,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=932, Invalid=4180, Unknown=0, NotChecked=0, Total=5112 [2024-11-14 03:55:56,434 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 949 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:55:56,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 300 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-14 03:55:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8714 states. [2024-11-14 03:55:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8714 to 2555. [2024-11-14 03:55:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2554 states have (on average 3.5790916209866874) internal successors, (9141), 2554 states have internal predecessors, (9141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 9141 transitions. [2024-11-14 03:55:56,634 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 9141 transitions. Word has length 28 [2024-11-14 03:55:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:55:56,635 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 9141 transitions. [2024-11-14 03:55:56,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:55:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 9141 transitions. [2024-11-14 03:55:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:55:56,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:56,642 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:55:56,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-14 03:55:56,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-14 03:55:56,843 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:55:56,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -250557022, now seen corresponding path program 6 times [2024-11-14 03:55:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243600469] [2024-11-14 03:55:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:55:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:55:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:57,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:55:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243600469] [2024-11-14 03:55:57,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243600469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:55:57,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072918144] [2024-11-14 03:55:57,539 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:55:57,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:55:57,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:55:57,542 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:55:57,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 03:55:57,670 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:55:57,671 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:55:57,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:55:57,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:55:57,745 INFO L378 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 15 treesize of output 1 [2024-11-14 03:55:58,128 INFO L378 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 55 treesize of output 53 [2024-11-14 03:55:58,135 INFO L378 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 53 treesize of output 51 [2024-11-14 03:55:58,263 INFO L378 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 33 treesize of output 21 [2024-11-14 03:55:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:58,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:55:58,895 INFO L378 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 79 treesize of output 77 [2024-11-14 03:55:58,902 INFO L378 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 77 treesize of output 75 [2024-11-14 03:55:59,779 INFO L378 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 108 treesize of output 96 [2024-11-14 03:55:59,786 INFO L378 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 144 treesize of output 132 [2024-11-14 03:55:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:55:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072918144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:55:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155085328] [2024-11-14 03:55:59,993 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:55:59,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:55:59,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2024-11-14 03:55:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661064214] [2024-11-14 03:55:59,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:55:59,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 03:55:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:55:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 03:55:59,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 03:55:59,995 INFO L87 Difference]: Start difference. First operand 2555 states and 9141 transitions. Second operand has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:11,669 INFO L93 Difference]: Finished difference Result 8168 states and 29030 transitions. [2024-11-14 03:56:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-11-14 03:56:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:56:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:11,696 INFO L225 Difference]: With dead ends: 8168 [2024-11-14 03:56:11,697 INFO L226 Difference]: Without dead ends: 8056 [2024-11-14 03:56:11,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3349 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1785, Invalid=9987, Unknown=0, NotChecked=0, Total=11772 [2024-11-14 03:56:11,704 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 850 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 4636 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 4692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:11,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 519 Invalid, 4692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 4636 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 03:56:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8056 states. [2024-11-14 03:56:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8056 to 2653. [2024-11-14 03:56:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2652 states have (on average 3.5460030165912517) internal successors, (9404), 2652 states have internal predecessors, (9404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 9404 transitions. [2024-11-14 03:56:11,859 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 9404 transitions. Word has length 28 [2024-11-14 03:56:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:11,859 INFO L471 AbstractCegarLoop]: Abstraction has 2653 states and 9404 transitions. [2024-11-14 03:56:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 9404 transitions. [2024-11-14 03:56:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:56:11,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:11,870 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:56:11,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-14 03:56:12,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:12,071 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:56:12,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -129546478, now seen corresponding path program 7 times [2024-11-14 03:56:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459914844] [2024-11-14 03:56:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:12,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459914844] [2024-11-14 03:56:12,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459914844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:56:12,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295269857] [2024-11-14 03:56:12,794 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:56:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:12,801 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:56:12,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 03:56:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:12,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 03:56:12,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:13,024 INFO L378 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 15 treesize of output 1 [2024-11-14 03:56:13,521 INFO L378 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 17 treesize of output 9 [2024-11-14 03:56:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:13,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:56:13,711 INFO L378 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 79 treesize of output 77 [2024-11-14 03:56:13,723 INFO L378 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 77 treesize of output 75 [2024-11-14 03:56:14,917 INFO L378 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 169 treesize of output 157 [2024-11-14 03:56:14,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:14,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 218 [2024-11-14 03:56:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295269857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:56:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [171873060] [2024-11-14 03:56:24,017 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:56:24,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:56:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:56:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317247756] [2024-11-14 03:56:24,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:56:24,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:56:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:24,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:56:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:56:24,019 INFO L87 Difference]: Start difference. First operand 2653 states and 9404 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:28,531 INFO L93 Difference]: Finished difference Result 4181 states and 14653 transitions. [2024-11-14 03:56:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-14 03:56:28,531 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:56:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:28,546 INFO L225 Difference]: With dead ends: 4181 [2024-11-14 03:56:28,546 INFO L226 Difference]: Without dead ends: 4067 [2024-11-14 03:56:28,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=444, Invalid=2418, Unknown=0, NotChecked=0, Total=2862 [2024-11-14 03:56:28,549 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 514 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:28,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 110 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 03:56:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2024-11-14 03:56:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 2677. [2024-11-14 03:56:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2676 states have (on average 3.5426008968609866) internal successors, (9480), 2676 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 9480 transitions. [2024-11-14 03:56:28,649 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 9480 transitions. Word has length 28 [2024-11-14 03:56:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:28,650 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 9480 transitions. [2024-11-14 03:56:28,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 9480 transitions. [2024-11-14 03:56:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:56:28,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:28,658 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:56:28,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 03:56:28,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:28,862 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:56:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash 951416230, now seen corresponding path program 8 times [2024-11-14 03:56:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:28,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954587602] [2024-11-14 03:56:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:28,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:29,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:29,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954587602] [2024-11-14 03:56:29,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954587602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:56:29,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137250106] [2024-11-14 03:56:29,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:56:29,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:29,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:29,613 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:56:29,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 03:56:29,805 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:56:29,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:56:29,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:56:29,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:29,898 INFO L378 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 15 treesize of output 1 [2024-11-14 03:56:30,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:56:30,431 INFO L378 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 79 treesize of output 59 [2024-11-14 03:56:30,439 INFO L378 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 42 treesize of output 40 [2024-11-14 03:56:30,447 INFO L378 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 40 treesize of output 38 [2024-11-14 03:56:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:30,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:56:30,979 INFO L378 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 79 treesize of output 77 [2024-11-14 03:56:30,987 INFO L378 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 77 treesize of output 75 [2024-11-14 03:56:32,141 INFO L378 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 96 treesize of output 86 [2024-11-14 03:56:32,152 INFO L378 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 125 treesize of output 115 [2024-11-14 03:56:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137250106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:56:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1569466719] [2024-11-14 03:56:32,403 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:56:32,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:56:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2024-11-14 03:56:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119019287] [2024-11-14 03:56:32,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:56:32,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 03:56:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 03:56:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2024-11-14 03:56:32,406 INFO L87 Difference]: Start difference. First operand 2677 states and 9480 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:42,827 INFO L93 Difference]: Finished difference Result 10516 states and 38876 transitions. [2024-11-14 03:56:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-11-14 03:56:42,828 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:56:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:42,863 INFO L225 Difference]: With dead ends: 10516 [2024-11-14 03:56:42,863 INFO L226 Difference]: Without dead ends: 10413 [2024-11-14 03:56:42,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1247, Invalid=6235, Unknown=0, NotChecked=0, Total=7482 [2024-11-14 03:56:42,868 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 885 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 3382 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:42,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 262 Invalid, 3446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3382 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-14 03:56:42,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10413 states. [2024-11-14 03:56:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10413 to 2851. [2024-11-14 03:56:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 3.5698245614035087) internal successors, (10174), 2850 states have internal predecessors, (10174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 10174 transitions. [2024-11-14 03:56:43,026 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 10174 transitions. Word has length 28 [2024-11-14 03:56:43,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:43,026 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 10174 transitions. [2024-11-14 03:56:43,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 10174 transitions. [2024-11-14 03:56:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:56:43,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:43,032 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:56:43,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 03:56:43,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 03:56:43,232 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:56:43,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2005262310, now seen corresponding path program 9 times [2024-11-14 03:56:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628066295] [2024-11-14 03:56:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:43,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:43,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628066295] [2024-11-14 03:56:43,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628066295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:56:43,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89843162] [2024-11-14 03:56:43,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:56:43,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:43,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:43,829 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:56:43,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 03:56:43,950 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:56:43,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:56:43,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:56:43,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:44,005 INFO L378 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 15 treesize of output 1 [2024-11-14 03:56:44,369 INFO L378 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 70 treesize of output 50 [2024-11-14 03:56:44,373 INFO L378 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 43 treesize of output 41 [2024-11-14 03:56:44,382 INFO L378 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 39 [2024-11-14 03:56:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:44,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:56:44,821 INFO L378 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 79 treesize of output 77 [2024-11-14 03:56:44,827 INFO L378 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 77 treesize of output 75 [2024-11-14 03:56:45,746 INFO L378 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 108 treesize of output 96 [2024-11-14 03:56:45,750 INFO L378 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 144 treesize of output 132 [2024-11-14 03:56:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:45,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89843162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:56:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [638557465] [2024-11-14 03:56:45,926 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:56:45,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:56:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2024-11-14 03:56:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806505594] [2024-11-14 03:56:45,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:56:45,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 03:56:45,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:45,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 03:56:45,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 03:56:45,928 INFO L87 Difference]: Start difference. First operand 2851 states and 10174 transitions. Second operand has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:58,124 INFO L93 Difference]: Finished difference Result 7133 states and 25069 transitions. [2024-11-14 03:56:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-14 03:56:58,125 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:56:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:58,147 INFO L225 Difference]: With dead ends: 7133 [2024-11-14 03:56:58,147 INFO L226 Difference]: Without dead ends: 7058 [2024-11-14 03:56:58,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4329 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2244, Invalid=12762, Unknown=0, NotChecked=0, Total=15006 [2024-11-14 03:56:58,153 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 691 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 4899 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 4951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:58,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 342 Invalid, 4951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4899 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-14 03:56:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7058 states. [2024-11-14 03:56:58,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7058 to 2859. [2024-11-14 03:56:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2858 states have (on average 3.568929321203639) internal successors, (10200), 2858 states have internal predecessors, (10200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 10200 transitions. [2024-11-14 03:56:58,251 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 10200 transitions. Word has length 28 [2024-11-14 03:56:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:58,251 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 10200 transitions. [2024-11-14 03:56:58,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:56:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 10200 transitions. [2024-11-14 03:56:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:56:58,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:58,257 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:56:58,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 03:56:58,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:58,457 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:56:58,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -510461580, now seen corresponding path program 10 times [2024-11-14 03:56:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936807147] [2024-11-14 03:56:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:56:59,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:59,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936807147] [2024-11-14 03:56:59,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936807147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:56:59,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328100067] [2024-11-14 03:56:59,342 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:56:59,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:56:59,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:56:59,345 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:56:59,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 03:56:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:59,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-14 03:56:59,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:56:59,615 INFO L378 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 15 treesize of output 1 [2024-11-14 03:57:00,074 INFO L378 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 17 treesize of output 9 [2024-11-14 03:57:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:00,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:00,272 INFO L378 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 79 treesize of output 77 [2024-11-14 03:57:00,278 INFO L378 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 77 treesize of output 75 [2024-11-14 03:57:01,435 INFO L378 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 169 treesize of output 157 [2024-11-14 03:57:01,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:01,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 218 [2024-11-14 03:57:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328100067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:10,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [105222614] [2024-11-14 03:57:10,705 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:57:10,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:57:10,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:57:10,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505480172] [2024-11-14 03:57:10,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:10,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:57:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:57:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:57:10,707 INFO L87 Difference]: Start difference. First operand 2859 states and 10200 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:13,782 INFO L93 Difference]: Finished difference Result 4059 states and 14332 transitions. [2024-11-14 03:57:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:57:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:57:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:13,796 INFO L225 Difference]: With dead ends: 4059 [2024-11-14 03:57:13,796 INFO L226 Difference]: Without dead ends: 3915 [2024-11-14 03:57:13,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=368, Invalid=1794, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 03:57:13,798 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 405 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:13,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 93 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 03:57:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2024-11-14 03:57:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 2873. [2024-11-14 03:57:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2872 states have (on average 3.5630222841225625) internal successors, (10233), 2872 states have internal predecessors, (10233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 10233 transitions. [2024-11-14 03:57:13,864 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 10233 transitions. Word has length 28 [2024-11-14 03:57:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:13,864 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 10233 transitions. [2024-11-14 03:57:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 10233 transitions. [2024-11-14 03:57:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:57:13,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:13,869 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:57:13,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-14 03:57:14,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:14,070 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:57:14,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:14,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1152192658, now seen corresponding path program 11 times [2024-11-14 03:57:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082846553] [2024-11-14 03:57:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:14,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:14,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082846553] [2024-11-14 03:57:14,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082846553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:14,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108346786] [2024-11-14 03:57:14,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:57:14,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:14,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:14,726 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:14,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 03:57:14,846 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:57:14,846 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:57:14,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 03:57:14,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:14,935 INFO L378 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 15 treesize of output 1 [2024-11-14 03:57:15,422 INFO L378 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 67 treesize of output 47 [2024-11-14 03:57:15,426 INFO L378 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 38 treesize of output 36 [2024-11-14 03:57:15,431 INFO L378 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 36 treesize of output 34 [2024-11-14 03:57:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:15,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:15,658 INFO L378 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 79 treesize of output 77 [2024-11-14 03:57:15,665 INFO L378 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 77 treesize of output 75 [2024-11-14 03:57:16,768 INFO L378 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 183 treesize of output 169 [2024-11-14 03:57:16,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:16,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2024-11-14 03:57:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:30,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108346786] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:30,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [38364884] [2024-11-14 03:57:30,498 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:57:30,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:57:30,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:57:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796287381] [2024-11-14 03:57:30,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:30,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:57:30,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:30,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:57:30,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:57:30,500 INFO L87 Difference]: Start difference. First operand 2873 states and 10233 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:33,165 INFO L93 Difference]: Finished difference Result 3998 states and 14176 transitions. [2024-11-14 03:57:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 03:57:33,165 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:57:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:33,179 INFO L225 Difference]: With dead ends: 3998 [2024-11-14 03:57:33,179 INFO L226 Difference]: Without dead ends: 3869 [2024-11-14 03:57:33,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 03:57:33,181 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 250 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:33,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 89 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 03:57:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2024-11-14 03:57:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 2859. [2024-11-14 03:57:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2858 states have (on average 3.564030790762771) internal successors, (10186), 2858 states have internal predecessors, (10186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 10186 transitions. [2024-11-14 03:57:33,246 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 10186 transitions. Word has length 28 [2024-11-14 03:57:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 10186 transitions. [2024-11-14 03:57:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 10186 transitions. [2024-11-14 03:57:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:57:33,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:33,253 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:57:33,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 03:57:33,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-14 03:57:33,453 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:57:33,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 897215670, now seen corresponding path program 12 times [2024-11-14 03:57:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44669621] [2024-11-14 03:57:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:34,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:34,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44669621] [2024-11-14 03:57:34,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44669621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:34,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430668481] [2024-11-14 03:57:34,173 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:57:34,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:34,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:34,176 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:34,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 03:57:34,295 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:57:34,295 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:57:34,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 03:57:34,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:34,373 INFO L378 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 15 treesize of output 1 [2024-11-14 03:57:34,855 INFO L378 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 50 treesize of output 48 [2024-11-14 03:57:34,863 INFO L378 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 65 treesize of output 45 [2024-11-14 03:57:34,867 INFO L378 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 36 treesize of output 34 [2024-11-14 03:57:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:34,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:35,090 INFO L378 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 79 treesize of output 77 [2024-11-14 03:57:35,096 INFO L378 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 77 treesize of output 75 [2024-11-14 03:57:36,252 INFO L378 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 169 treesize of output 157 [2024-11-14 03:57:36,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:36,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 218 [2024-11-14 03:57:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430668481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:57:49,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131178559] [2024-11-14 03:57:49,855 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:57:49,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:57:49,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:57:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898576816] [2024-11-14 03:57:49,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:57:49,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:57:49,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:57:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:57:49,858 INFO L87 Difference]: Start difference. First operand 2859 states and 10186 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:57:53,436 INFO L93 Difference]: Finished difference Result 4373 states and 15485 transitions. [2024-11-14 03:57:53,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 03:57:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:57:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:57:53,451 INFO L225 Difference]: With dead ends: 4373 [2024-11-14 03:57:53,451 INFO L226 Difference]: Without dead ends: 4269 [2024-11-14 03:57:53,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=400, Invalid=2050, Unknown=0, NotChecked=0, Total=2450 [2024-11-14 03:57:53,454 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 538 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:57:53,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 91 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-14 03:57:53,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2024-11-14 03:57:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 2877. [2024-11-14 03:57:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2876 states have (on average 3.5552851182197496) internal successors, (10225), 2876 states have internal predecessors, (10225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 10225 transitions. [2024-11-14 03:57:53,552 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 10225 transitions. Word has length 28 [2024-11-14 03:57:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:57:53,553 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 10225 transitions. [2024-11-14 03:57:53,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:57:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 10225 transitions. [2024-11-14 03:57:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:57:53,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:57:53,557 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:57:53,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 03:57:53,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 03:57:53,758 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:57:53,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:57:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 240642378, now seen corresponding path program 13 times [2024-11-14 03:57:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:57:53,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049506791] [2024-11-14 03:57:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:57:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:54,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049506791] [2024-11-14 03:57:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049506791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:57:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350159859] [2024-11-14 03:57:54,527 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 03:57:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:57:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:57:54,530 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:57:54,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 03:57:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:54,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:57:54,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:57:54,735 INFO L378 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 15 treesize of output 1 [2024-11-14 03:57:55,141 INFO L378 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 72 treesize of output 52 [2024-11-14 03:57:55,146 INFO L378 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 43 treesize of output 41 [2024-11-14 03:57:55,151 INFO L378 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 39 [2024-11-14 03:57:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:57:55,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:57:55,462 INFO L378 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 79 treesize of output 77 [2024-11-14 03:57:55,468 INFO L378 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 77 treesize of output 75 [2024-11-14 03:57:56,454 INFO L378 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 183 treesize of output 169 [2024-11-14 03:57:56,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:57:56,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 222 treesize of output 232 [2024-11-14 03:58:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:03,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350159859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:58:03,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [753336315] [2024-11-14 03:58:03,899 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:58:03,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:58:03,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-11-14 03:58:03,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109075532] [2024-11-14 03:58:03,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:58:03,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 03:58:03,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 03:58:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2024-11-14 03:58:03,900 INFO L87 Difference]: Start difference. First operand 2877 states and 10225 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:07,004 INFO L93 Difference]: Finished difference Result 4288 states and 15261 transitions. [2024-11-14 03:58:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:58:07,005 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:58:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:07,019 INFO L225 Difference]: With dead ends: 4288 [2024-11-14 03:58:07,019 INFO L226 Difference]: Without dead ends: 4223 [2024-11-14 03:58:07,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=341, Invalid=1821, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 03:58:07,022 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 363 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:07,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 88 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-14 03:58:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2024-11-14 03:58:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 2859. [2024-11-14 03:58:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2858 states have (on average 3.5598320503848844) internal successors, (10174), 2858 states have internal predecessors, (10174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 10174 transitions. [2024-11-14 03:58:07,094 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 10174 transitions. Word has length 28 [2024-11-14 03:58:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:07,094 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 10174 transitions. [2024-11-14 03:58:07,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 10174 transitions. [2024-11-14 03:58:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:58:07,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:07,128 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:58:07,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 03:58:07,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:07,329 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:58:07,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash -669625126, now seen corresponding path program 14 times [2024-11-14 03:58:07,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:07,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425442380] [2024-11-14 03:58:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:07,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:07,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:07,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425442380] [2024-11-14 03:58:07,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425442380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:58:07,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74195018] [2024-11-14 03:58:07,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:58:07,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:07,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:58:07,925 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:58:07,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 03:58:08,042 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:58:08,042 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:58:08,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-14 03:58:08,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:08,117 INFO L378 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 15 treesize of output 1 [2024-11-14 03:58:08,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:58:08,603 INFO L378 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 72 treesize of output 56 [2024-11-14 03:58:08,608 INFO L378 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 39 [2024-11-14 03:58:08,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-14 03:58:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:09,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:09,416 INFO L378 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 79 treesize of output 77 [2024-11-14 03:58:09,425 INFO L378 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 77 treesize of output 75 [2024-11-14 03:58:11,017 INFO L378 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 153 treesize of output 141 [2024-11-14 03:58:11,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:58:11,029 INFO L378 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 207 treesize of output 178 [2024-11-14 03:58:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74195018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:58:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [955509792] [2024-11-14 03:58:11,501 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:58:11,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:58:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2024-11-14 03:58:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357120955] [2024-11-14 03:58:11,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:58:11,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-14 03:58:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-14 03:58:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2024-11-14 03:58:11,503 INFO L87 Difference]: Start difference. First operand 2859 states and 10174 transitions. Second operand has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:17,350 INFO L93 Difference]: Finished difference Result 4842 states and 17198 transitions. [2024-11-14 03:58:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-14 03:58:17,350 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:58:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:17,367 INFO L225 Difference]: With dead ends: 4842 [2024-11-14 03:58:17,367 INFO L226 Difference]: Without dead ends: 4740 [2024-11-14 03:58:17,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=504, Invalid=2918, Unknown=0, NotChecked=0, Total=3422 [2024-11-14 03:58:17,369 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 601 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:17,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 63 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-14 03:58:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4740 states. [2024-11-14 03:58:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4740 to 2841. [2024-11-14 03:58:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2840 states have (on average 3.560211267605634) internal successors, (10111), 2840 states have internal predecessors, (10111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 10111 transitions. [2024-11-14 03:58:17,441 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 10111 transitions. Word has length 28 [2024-11-14 03:58:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:17,441 INFO L471 AbstractCegarLoop]: Abstraction has 2841 states and 10111 transitions. [2024-11-14 03:58:17,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 32 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 10111 transitions. [2024-11-14 03:58:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:58:17,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:17,447 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:58:17,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-14 03:58:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:17,648 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:58:17,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1028926828, now seen corresponding path program 15 times [2024-11-14 03:58:17,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767047549] [2024-11-14 03:58:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:18,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767047549] [2024-11-14 03:58:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767047549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:58:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008831462] [2024-11-14 03:58:18,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:58:18,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:18,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:58:18,437 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:58:18,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 03:58:18,554 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:58:18,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:58:18,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:58:18,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:18,612 INFO L378 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 15 treesize of output 1 [2024-11-14 03:58:18,956 INFO L378 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 55 treesize of output 53 [2024-11-14 03:58:18,965 INFO L378 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 53 treesize of output 51 [2024-11-14 03:58:19,121 INFO L378 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 33 treesize of output 21 [2024-11-14 03:58:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:19,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:19,665 INFO L378 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 79 treesize of output 77 [2024-11-14 03:58:19,671 INFO L378 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 77 treesize of output 75 [2024-11-14 03:58:20,604 INFO L378 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 108 treesize of output 96 [2024-11-14 03:58:20,608 INFO L378 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 144 treesize of output 132 [2024-11-14 03:58:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:20,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008831462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:58:20,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930000330] [2024-11-14 03:58:20,835 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 03:58:20,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:58:20,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 33 [2024-11-14 03:58:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729323912] [2024-11-14 03:58:20,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:58:20,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 03:58:20,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 03:58:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 03:58:20,837 INFO L87 Difference]: Start difference. First operand 2841 states and 10111 transitions. Second operand has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:46,452 INFO L93 Difference]: Finished difference Result 13648 states and 49238 transitions. [2024-11-14 03:58:46,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2024-11-14 03:58:46,453 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 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 [2024-11-14 03:58:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:46,496 INFO L225 Difference]: With dead ends: 13648 [2024-11-14 03:58:46,496 INFO L226 Difference]: Without dead ends: 13562 [2024-11-14 03:58:46,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10991 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=3845, Invalid=25911, Unknown=0, NotChecked=0, Total=29756 [2024-11-14 03:58:46,504 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1198 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 5837 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 5923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 5837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:46,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 643 Invalid, 5923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 5837 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-14 03:58:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13562 states. [2024-11-14 03:58:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13562 to 2801. [2024-11-14 03:58:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2800 states have (on average 3.5825) internal successors, (10031), 2800 states have internal predecessors, (10031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 10031 transitions. [2024-11-14 03:58:46,662 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 10031 transitions. Word has length 28 [2024-11-14 03:58:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:46,662 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 10031 transitions. [2024-11-14 03:58:46,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.411764705882353) internal successors, (82), 33 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 10031 transitions. [2024-11-14 03:58:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:58:46,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:46,667 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:46,687 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-14 03:58:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-14 03:58:46,868 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 03:58:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash 741829277, now seen corresponding path program 1 times [2024-11-14 03:58:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860578201] [2024-11-14 03:58:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:47,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860578201] [2024-11-14 03:58:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860578201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:58:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998427133] [2024-11-14 03:58:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:47,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:58:47,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:58:47,758 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:58:47,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-14 03:58:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:47,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 03:58:47,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:47,952 INFO L378 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 15 treesize of output 1 [2024-11-14 03:58:48,217 INFO L378 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 5 treesize of output 3 [2024-11-14 03:58:48,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-14 03:58:48,461 INFO L378 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 29 treesize of output 13 [2024-11-14 03:58:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:48,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:58:48,937 INFO L378 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 79 treesize of output 77 [2024-11-14 03:58:48,946 INFO L378 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 77 treesize of output 75 [2024-11-14 03:58:50,272 INFO L378 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 387 treesize of output 351 [2024-11-14 03:58:50,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:58:50,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 663 treesize of output 659 [2024-11-14 03:59:12,266 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-14 04:01:12,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-14 04:01:12,479 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-14 04:01:12,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-14 04:01:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1416845994] [2024-11-14 04:01:12,480 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:311) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:286) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:184) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:179) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1715) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) 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:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2024-11-14 04:01:12,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:01:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-14 04:01:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778559958] [2024-11-14 04:01:12,481 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:12,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 04:01:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:01:12,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 04:01:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2024-11-14 04:01:12,482 INFO L87 Difference]: Start difference. First operand 2801 states and 10031 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:12,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2024-11-14 04:01:12,483 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:12,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:01:12,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2024-11-14 04:01:12,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-14 04:01:12,684 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:762) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:447) at java.base/java.io.OutputStream.write(OutputStream.java:167) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:125) at java.base/java.io.BufferedOutputStream.implFlush(BufferedOutputStream.java:252) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:246) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:412) at java.base/sun.nio.cs.StreamEncoder.lockedFlush(StreamEncoder.java:214) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:201) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:262) at java.base/java.io.BufferedWriter.implFlush(BufferedWriter.java:372) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:359) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-14 04:01:12,687 INFO L158 Benchmark]: Toolchain (without parser) took 440589.65ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 93.5MB in the beginning and 1.1GB in the end (delta: -966.0MB). Peak memory consumption was 449.9MB. Max. memory is 16.1GB. [2024-11-14 04:01:12,687 INFO L158 Benchmark]: CDTParser took 1.86ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:01:12,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.60ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 81.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:01:12,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.79ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 79.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:01:12,688 INFO L158 Benchmark]: Boogie Preprocessor took 67.34ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:01:12,688 INFO L158 Benchmark]: RCFGBuilder took 1393.82ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 52.1MB in the end (delta: 25.6MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-14 04:01:12,688 INFO L158 Benchmark]: TraceAbstraction took 438656.82ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 51.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 412.0MB. Max. memory is 16.1GB. [2024-11-14 04:01:12,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.86ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.60ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 81.4MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.79ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 79.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.34ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1393.82ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 52.1MB in the end (delta: 25.6MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 438656.82ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 51.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 412.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:01:15,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:01:15,474 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 04:01:15,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:01:15,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:01:15,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:01:15,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:01:15,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:01:15,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:01:15,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:01:15,532 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:01:15,532 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:01:15,532 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:01:15,532 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:01:15,533 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:01:15,533 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:01:15,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:01:15,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:01:15,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:01:15,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:01:15,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:01:15,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:01:15,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:01:15,536 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:01:15,537 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:01:15,537 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:01:15,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:01:15,537 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:01:15,537 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 04:01:15,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:01:15,537 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 04:01:15,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:01:15,538 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:01:15,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:01:15,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:01:15,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 04:01:15,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:01:15,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:01:15,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:01:15,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:01:15,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:01:15,540 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 04:01:15,540 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:15,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:01:15,541 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:01:15,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-11-14 04:01:15,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:01:15,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:01:15,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:01:15,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:01:15,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:01:15,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c Unable to find full path for "g++" [2024-11-14 04:01:17,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:01:18,155 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:01:18,159 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-11-14 04:01:18,169 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data/f3e97f0a7/70574967b8e64e49842809eedf2e0a3d/FLAG4927482d6 [2024-11-14 04:01:18,201 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/data/f3e97f0a7/70574967b8e64e49842809eedf2e0a3d [2024-11-14 04:01:18,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:01:18,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:01:18,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:01:18,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:01:18,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:01:18,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68d3a245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18, skipping insertion in model container [2024-11-14 04:01:18,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:01:18,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:01:18,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:01:18,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:01:18,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:01:18,582 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:01:18,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18 WrapperNode [2024-11-14 04:01:18,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:01:18,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:01:18,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:01:18,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:01:18,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,656 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 207 [2024-11-14 04:01:18,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:01:18,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:01:18,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:01:18,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:01:18,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:01:18,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:01:18,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:01:18,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:01:18,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (1/1) ... [2024-11-14 04:01:18,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:01:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:18,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:01:18,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:01:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:01:18,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 04:01:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 04:01:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 04:01:18,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 04:01:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 04:01:18,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 04:01:18,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-14 04:01:18,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-14 04:01:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 04:01:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 04:01:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:01:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:01:18,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:01:18,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 04:01:18,800 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 04:01:18,954 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:01:18,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:01:19,835 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 04:01:19,835 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:01:20,422 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:01:20,422 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-14 04:01:20,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:01:20 BoogieIcfgContainer [2024-11-14 04:01:20,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:01:20,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:01:20,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:01:20,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:01:20,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:01:18" (1/3) ... [2024-11-14 04:01:20,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42075abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:01:20, skipping insertion in model container [2024-11-14 04:01:20,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:01:18" (2/3) ... [2024-11-14 04:01:20,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42075abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:01:20, skipping insertion in model container [2024-11-14 04:01:20,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:01:20" (3/3) ... [2024-11-14 04:01:20,434 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-11-14 04:01:20,450 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:01:20,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2024-11-14 04:01:20,452 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 04:01:20,560 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-14 04:01:20,600 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 58 transitions, 137 flow [2024-11-14 04:01:20,900 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3069 states, 2891 states have (on average 3.8135593220338984) internal successors, (11025), 3068 states have internal predecessors, (11025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:20,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:01:20,949 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@30aca54c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:01:20,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-14 04:01:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 3069 states, 2891 states have (on average 3.8135593220338984) internal successors, (11025), 3068 states have internal predecessors, (11025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:01:20,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:20,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:01:20,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:20,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash 705871, now seen corresponding path program 1 times [2024-11-14 04:01:20,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:20,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435663364] [2024-11-14 04:01:20,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:20,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:20,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:20,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:21,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 04:01:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:21,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:01:21,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:21,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 04:01:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:21,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:21,250 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:21,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435663364] [2024-11-14 04:01:21,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435663364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:21,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:01:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 04:01:21,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195835387] [2024-11-14 04:01:21,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:21,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:01:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:21,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:01:21,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:01:21,300 INFO L87 Difference]: Start difference. First operand has 3069 states, 2891 states have (on average 3.8135593220338984) internal successors, (11025), 3068 states have internal predecessors, (11025), 0 states have call successors, (0), 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 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) [2024-11-14 04:01:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:21,741 INFO L93 Difference]: Finished difference Result 3069 states and 11025 transitions. [2024-11-14 04:01:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:01:21,745 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 [2024-11-14 04:01:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:21,800 INFO L225 Difference]: With dead ends: 3069 [2024-11-14 04:01:21,800 INFO L226 Difference]: Without dead ends: 2050 [2024-11-14 04:01:21,814 INFO L431 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 [2024-11-14 04:01:21,819 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:21,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 24 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 04:01:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2024-11-14 04:01:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2024-11-14 04:01:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1974 states have (on average 3.7051671732522795) internal successors, (7314), 2049 states have internal predecessors, (7314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 7314 transitions. [2024-11-14 04:01:22,121 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 7314 transitions. Word has length 3 [2024-11-14 04:01:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:22,123 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 7314 transitions. [2024-11-14 04:01:22,123 INFO L472 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) [2024-11-14 04:01:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 7314 transitions. [2024-11-14 04:01:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:01:22,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:22,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:01:22,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 04:01:22,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:22,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:22,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash 705872, now seen corresponding path program 1 times [2024-11-14 04:01:22,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183795108] [2024-11-14 04:01:22,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:22,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:22,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:22,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:22,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 04:01:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:22,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:01:22,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:22,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:22,668 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183795108] [2024-11-14 04:01:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183795108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:22,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:01:22,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:01:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203230188] [2024-11-14 04:01:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:22,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:01:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:22,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:01:22,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:01:22,675 INFO L87 Difference]: Start difference. First operand 2050 states and 7314 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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) [2024-11-14 04:01:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:23,196 INFO L93 Difference]: Finished difference Result 2053 states and 7318 transitions. [2024-11-14 04:01:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:01:23,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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 [2024-11-14 04:01:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:23,230 INFO L225 Difference]: With dead ends: 2053 [2024-11-14 04:01:23,230 INFO L226 Difference]: Without dead ends: 2052 [2024-11-14 04:01:23,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:01:23,233 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:23,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:01:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2024-11-14 04:01:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052. [2024-11-14 04:01:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1976 states have (on average 3.702935222672065) internal successors, (7317), 2051 states have internal predecessors, (7317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 7317 transitions. [2024-11-14 04:01:23,412 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 7317 transitions. Word has length 3 [2024-11-14 04:01:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:23,413 INFO L471 AbstractCegarLoop]: Abstraction has 2052 states and 7317 transitions. [2024-11-14 04:01:23,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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) [2024-11-14 04:01:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 7317 transitions. [2024-11-14 04:01:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 04:01:23,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:23,415 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2024-11-14 04:01:23,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 04:01:23,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:23,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:23,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash 678365593, now seen corresponding path program 1 times [2024-11-14 04:01:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:23,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370751284] [2024-11-14 04:01:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:23,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:23,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:23,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:23,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 04:01:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:23,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:01:23,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:23,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:23,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:24,456 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370751284] [2024-11-14 04:01:24,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370751284] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [990533384] [2024-11-14 04:01:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:24,457 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:24,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:24,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:24,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-14 04:01:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:24,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 04:01:24,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:24,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:24,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [990533384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:24,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846891888] [2024-11-14 04:01:24,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:24,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:24,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:24,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:01:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:24,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 04:01:24,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:24,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:25,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:25,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846891888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:25,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:01:25,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 3, 3] total 9 [2024-11-14 04:01:25,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185008686] [2024-11-14 04:01:25,355 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:25,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:01:25,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:25,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:01:25,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-14 04:01:25,356 INFO L87 Difference]: Start difference. First operand 2052 states and 7317 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:26,701 INFO L93 Difference]: Finished difference Result 2059 states and 7329 transitions. [2024-11-14 04:01:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:01:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-14 04:01:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:26,725 INFO L225 Difference]: With dead ends: 2059 [2024-11-14 04:01:26,725 INFO L226 Difference]: Without dead ends: 2058 [2024-11-14 04:01:26,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:01:26,728 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:26,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 04:01:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2024-11-14 04:01:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2024-11-14 04:01:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 1982 states have (on average 3.6962663975782037) internal successors, (7326), 2057 states have internal predecessors, (7326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7326 transitions. [2024-11-14 04:01:26,857 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7326 transitions. Word has length 5 [2024-11-14 04:01:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:26,857 INFO L471 AbstractCegarLoop]: Abstraction has 2058 states and 7326 transitions. [2024-11-14 04:01:26,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7326 transitions. [2024-11-14 04:01:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:01:26,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:26,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:01:26,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-14 04:01:27,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 04:01:27,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 04:01:27,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:27,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:27,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash -442422247, now seen corresponding path program 1 times [2024-11-14 04:01:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956885133] [2024-11-14 04:01:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:27,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:27,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:27,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 04:01:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:27,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:01:27,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:27,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-14 04:01:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:27,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:27,571 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956885133] [2024-11-14 04:01:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956885133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:01:27,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:01:27,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575326025] [2024-11-14 04:01:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:01:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:27,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:01:27,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:01:27,573 INFO L87 Difference]: Start difference. First operand 2058 states and 7326 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) [2024-11-14 04:01:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:27,815 INFO L93 Difference]: Finished difference Result 2058 states and 7326 transitions. [2024-11-14 04:01:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:01:27,816 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 [2024-11-14 04:01:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:27,829 INFO L225 Difference]: With dead ends: 2058 [2024-11-14 04:01:27,829 INFO L226 Difference]: Without dead ends: 1228 [2024-11-14 04:01:27,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:01:27,835 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:27,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 12 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:01:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-14 04:01:27,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2024-11-14 04:01:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1209 states have (on average 3.622001654259719) internal successors, (4379), 1227 states have internal predecessors, (4379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 4379 transitions. [2024-11-14 04:01:27,891 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 4379 transitions. Word has length 6 [2024-11-14 04:01:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:27,893 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 4379 transitions. [2024-11-14 04:01:27,893 INFO L472 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) [2024-11-14 04:01:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 4379 transitions. [2024-11-14 04:01:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:01:27,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:27,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:01:27,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 04:01:28,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:28,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:28,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash -442422246, now seen corresponding path program 1 times [2024-11-14 04:01:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478078034] [2024-11-14 04:01:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:28,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:28,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:28,099 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:28,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 04:01:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:28,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:01:28,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:28,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:28,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:28,416 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:28,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478078034] [2024-11-14 04:01:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478078034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:28,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:01:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:01:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807514011] [2024-11-14 04:01:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:28,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:01:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:28,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:01:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:01:28,419 INFO L87 Difference]: Start difference. First operand 1228 states and 4379 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:28,945 INFO L93 Difference]: Finished difference Result 2124 states and 7785 transitions. [2024-11-14 04:01:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:01:28,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 04:01:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:28,963 INFO L225 Difference]: With dead ends: 2124 [2024-11-14 04:01:28,963 INFO L226 Difference]: Without dead ends: 1868 [2024-11-14 04:01:28,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:01:28,965 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 65 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:28,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 19 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:01:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2024-11-14 04:01:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1740. [2024-11-14 04:01:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1721 states have (on average 3.73910517141197) internal successors, (6435), 1739 states have internal predecessors, (6435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 6435 transitions. [2024-11-14 04:01:29,040 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 6435 transitions. Word has length 6 [2024-11-14 04:01:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:29,041 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 6435 transitions. [2024-11-14 04:01:29,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 6435 transitions. [2024-11-14 04:01:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 04:01:29,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:29,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:01:29,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-14 04:01:29,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:29,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:29,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash 25018099, now seen corresponding path program 1 times [2024-11-14 04:01:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664762206] [2024-11-14 04:01:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:29,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:29,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:29,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:29,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 04:01:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:29,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 04:01:29,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:29,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:29,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:29,553 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:29,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664762206] [2024-11-14 04:01:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664762206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:01:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:01:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796309699] [2024-11-14 04:01:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:29,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:01:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:29,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:01:29,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:01:29,555 INFO L87 Difference]: Start difference. First operand 1740 states and 6435 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:30,146 INFO L93 Difference]: Finished difference Result 3056 states and 11599 transitions. [2024-11-14 04:01:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:01:30,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-14 04:01:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:30,173 INFO L225 Difference]: With dead ends: 3056 [2024-11-14 04:01:30,173 INFO L226 Difference]: Without dead ends: 2680 [2024-11-14 04:01:30,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:01:30,176 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 62 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:30,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 17 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:01:30,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2024-11-14 04:01:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2492. [2024-11-14 04:01:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2473 states have (on average 3.860493327941771) internal successors, (9547), 2491 states have internal predecessors, (9547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 9547 transitions. [2024-11-14 04:01:30,278 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 9547 transitions. Word has length 8 [2024-11-14 04:01:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:30,282 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 9547 transitions. [2024-11-14 04:01:30,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:30,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 9547 transitions. [2024-11-14 04:01:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:01:30,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:30,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:01:30,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-14 04:01:30,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:30,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:30,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1762711296, now seen corresponding path program 1 times [2024-11-14 04:01:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982480148] [2024-11-14 04:01:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:30,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:30,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:30,489 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:30,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 04:01:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:30,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 04:01:30,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:30,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:01:30,607 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:30,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982480148] [2024-11-14 04:01:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982480148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:01:30,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:01:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:01:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040975614] [2024-11-14 04:01:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:01:30,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:01:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:01:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:01:30,611 INFO L87 Difference]: Start difference. First operand 2492 states and 9547 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2024-11-14 04:01:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:30,828 INFO L93 Difference]: Finished difference Result 4972 states and 19077 transitions. [2024-11-14 04:01:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:01:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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 [2024-11-14 04:01:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:30,895 INFO L225 Difference]: With dead ends: 4972 [2024-11-14 04:01:30,895 INFO L226 Difference]: Without dead ends: 2492 [2024-11-14 04:01:30,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:01:30,899 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:30,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:01:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2024-11-14 04:01:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2492. [2024-11-14 04:01:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2473 states have (on average 3.860088960776385) internal successors, (9546), 2491 states have internal predecessors, (9546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 9546 transitions. [2024-11-14 04:01:30,985 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 9546 transitions. Word has length 10 [2024-11-14 04:01:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:30,986 INFO L471 AbstractCegarLoop]: Abstraction has 2492 states and 9546 transitions. [2024-11-14 04:01:30,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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) [2024-11-14 04:01:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 9546 transitions. [2024-11-14 04:01:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 04:01:30,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:30,987 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1] [2024-11-14 04:01:30,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 04:01:31,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:31,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1816297716, now seen corresponding path program 2 times [2024-11-14 04:01:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665108259] [2024-11-14 04:01:31,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:01:31,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:31,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:31,190 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:31,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 04:01:31,273 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:01:31,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:01:31,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 04:01:31,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:31,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:31,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:32,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665108259] [2024-11-14 04:01:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665108259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:32,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2066730099] [2024-11-14 04:01:32,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:01:32,630 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:32,632 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:32,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-14 04:01:32,775 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:01:32,775 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:01:32,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 04:01:32,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:32,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:33,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2066730099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:33,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273894398] [2024-11-14 04:01:33,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:01:33,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:33,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:33,401 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:33,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 04:01:33,483 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:01:33,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:01:33,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 04:01:33,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:33,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:33,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273894398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:34,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:01:34,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 12 [2024-11-14 04:01:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918694822] [2024-11-14 04:01:34,046 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:34,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 04:01:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 04:01:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:01:34,047 INFO L87 Difference]: Start difference. First operand 2492 states and 9546 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:37,343 INFO L93 Difference]: Finished difference Result 2505 states and 9570 transitions. [2024-11-14 04:01:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 04:01:37,345 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 04:01:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:37,364 INFO L225 Difference]: With dead ends: 2505 [2024-11-14 04:01:37,364 INFO L226 Difference]: Without dead ends: 2504 [2024-11-14 04:01:37,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=229, Invalid=473, Unknown=0, NotChecked=0, Total=702 [2024-11-14 04:01:37,366 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:37,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 04:01:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-11-14 04:01:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2024-11-14 04:01:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2485 states have (on average 3.848692152917505) internal successors, (9564), 2503 states have internal predecessors, (9564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 9564 transitions. [2024-11-14 04:01:37,464 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 9564 transitions. Word has length 11 [2024-11-14 04:01:37,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:37,465 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 9564 transitions. [2024-11-14 04:01:37,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 9564 transitions. [2024-11-14 04:01:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:01:37,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:37,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:01:37,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-14 04:01:37,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 04:01:37,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-14 04:01:38,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:38,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:38,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1697394839, now seen corresponding path program 1 times [2024-11-14 04:01:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:38,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246252882] [2024-11-14 04:01:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:38,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:38,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:38,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:38,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 04:01:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:38,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 04:01:38,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:38,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:38,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:39,370 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246252882] [2024-11-14 04:01:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246252882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [912459245] [2024-11-14 04:01:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:39,371 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:39,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:39,373 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:39,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-14 04:01:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:39,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 04:01:39,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:39,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:40,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [912459245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828785038] [2024-11-14 04:01:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:40,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:40,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:40,609 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:40,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 04:01:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:40,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 04:01:40,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:40,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:40,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828785038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:41,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:01:41,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6, 6, 6, 6] total 17 [2024-11-14 04:01:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737824542] [2024-11-14 04:01:41,288 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:41,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 04:01:41,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:41,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 04:01:41,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-14 04:01:41,289 INFO L87 Difference]: Start difference. First operand 2504 states and 9564 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:45,162 INFO L93 Difference]: Finished difference Result 10635 states and 42482 transitions. [2024-11-14 04:01:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:01:45,163 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 04:01:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:45,231 INFO L225 Difference]: With dead ends: 10635 [2024-11-14 04:01:45,231 INFO L226 Difference]: Without dead ends: 9928 [2024-11-14 04:01:45,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2024-11-14 04:01:45,238 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 243 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:45,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 66 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-14 04:01:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9928 states. [2024-11-14 04:01:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9928 to 5698. [2024-11-14 04:01:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5679 states have (on average 3.8836062687092796) internal successors, (22055), 5697 states have internal predecessors, (22055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 22055 transitions. [2024-11-14 04:01:45,537 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 22055 transitions. Word has length 12 [2024-11-14 04:01:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:45,537 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 22055 transitions. [2024-11-14 04:01:45,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 22055 transitions. [2024-11-14 04:01:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:01:45,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:45,541 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:01:45,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-14 04:01:45,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-14 04:01:45,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 04:01:46,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:46,144 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:46,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1782139321, now seen corresponding path program 1 times [2024-11-14 04:01:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800702390] [2024-11-14 04:01:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:46,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:46,147 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:46,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-14 04:01:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:46,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:01:46,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:46,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:46,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:47,010 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800702390] [2024-11-14 04:01:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800702390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1809387956] [2024-11-14 04:01:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:47,011 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:47,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:47,013 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:47,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-14 04:01:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:47,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 04:01:47,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:47,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:47,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1809387956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:47,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011420716] [2024-11-14 04:01:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:47,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:47,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:47,950 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:47,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 04:01:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:48,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:01:48,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:48,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:01:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011420716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:48,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:01:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7, 7, 6, 6] total 28 [2024-11-14 04:01:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192619669] [2024-11-14 04:01:48,376 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 04:01:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 04:01:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-11-14 04:01:48,377 INFO L87 Difference]: Start difference. First operand 5698 states and 22055 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:01:52,621 INFO L93 Difference]: Finished difference Result 13232 states and 53449 transitions. [2024-11-14 04:01:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 04:01:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 04:01:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:01:52,687 INFO L225 Difference]: With dead ends: 13232 [2024-11-14 04:01:52,688 INFO L226 Difference]: Without dead ends: 10211 [2024-11-14 04:01:52,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2024-11-14 04:01:52,698 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 576 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:01:52,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 148 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-14 04:01:52,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10211 states. [2024-11-14 04:01:53,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10211 to 9792. [2024-11-14 04:01:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9792 states, 9779 states have (on average 3.932508436445444) internal successors, (38456), 9791 states have internal predecessors, (38456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9792 states to 9792 states and 38456 transitions. [2024-11-14 04:01:53,175 INFO L78 Accepts]: Start accepts. Automaton has 9792 states and 38456 transitions. Word has length 12 [2024-11-14 04:01:53,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:01:53,175 INFO L471 AbstractCegarLoop]: Abstraction has 9792 states and 38456 transitions. [2024-11-14 04:01:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:01:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9792 states and 38456 transitions. [2024-11-14 04:01:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 04:01:53,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:01:53,178 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:01:53,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-14 04:01:53,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-14 04:01:53,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 04:01:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:53,779 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:01:53,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:01:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1303322286, now seen corresponding path program 1 times [2024-11-14 04:01:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:01:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854502004] [2024-11-14 04:01:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:53,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:01:53,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:01:53,782 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:01:53,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-14 04:01:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:53,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 04:01:53,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:53,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:01:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:54,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:54,841 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:01:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854502004] [2024-11-14 04:01:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854502004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1483294468] [2024-11-14 04:01:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:54,841 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:01:54,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:01:54,846 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:01:54,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-14 04:01:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:55,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 04:01:55,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:55,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:55,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1483294468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960468702] [2024-11-14 04:01:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:01:55,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:01:55,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:01:55,683 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:01:55,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 04:01:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:01:55,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:01:55,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:01:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:55,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:01:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:01:56,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960468702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:01:56,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:01:56,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6, 6, 5, 5] total 23 [2024-11-14 04:01:56,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712781975] [2024-11-14 04:01:56,034 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:01:56,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 04:01:56,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:01:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 04:01:56,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2024-11-14 04:01:56,035 INFO L87 Difference]: Start difference. First operand 9792 states and 38456 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:02:02,020 INFO L93 Difference]: Finished difference Result 18647 states and 75864 transitions. [2024-11-14 04:02:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 04:02:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 04:02:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:02:02,116 INFO L225 Difference]: With dead ends: 18647 [2024-11-14 04:02:02,116 INFO L226 Difference]: Without dead ends: 15324 [2024-11-14 04:02:02,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2024-11-14 04:02:02,129 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 581 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:02:02,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 141 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 04:02:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15324 states. [2024-11-14 04:02:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15324 to 14722. [2024-11-14 04:02:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14722 states, 14713 states have (on average 4.03554679535105) internal successors, (59375), 14721 states have internal predecessors, (59375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14722 states to 14722 states and 59375 transitions. [2024-11-14 04:02:02,794 INFO L78 Accepts]: Start accepts. Automaton has 14722 states and 59375 transitions. Word has length 14 [2024-11-14 04:02:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:02:02,794 INFO L471 AbstractCegarLoop]: Abstraction has 14722 states and 59375 transitions. [2024-11-14 04:02:02,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 14722 states and 59375 transitions. [2024-11-14 04:02:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 04:02:02,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:02:02,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:02:02,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-14 04:02:03,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-14 04:02:03,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 04:02:03,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:02:03,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:02:03,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:02:03,402 INFO L85 PathProgramCache]: Analyzing trace with hash 351485056, now seen corresponding path program 1 times [2024-11-14 04:02:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:02:03,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252892910] [2024-11-14 04:02:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:02:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:02:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:02:03,404 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:02:03,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-14 04:02:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:02:03,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 04:02:03,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:03,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:02:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:02:04,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:02:06,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:02:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252892910] [2024-11-14 04:02:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252892910] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [697188049] [2024-11-14 04:02:06,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:02:06,027 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:02:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:02:06,028 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:02:06,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-14 04:02:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:02:06,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 04:02:06,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:06,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:02:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:02:07,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:02:09,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [697188049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:09,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711627658] [2024-11-14 04:02:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:02:09,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:02:09,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:02:09,844 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:02:09,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 04:02:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:02:09,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 04:02:09,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:09,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:02:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:02:10,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:02:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711627658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:11,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:02:11,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9, 10, 8, 9] total 26 [2024-11-14 04:02:11,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970765312] [2024-11-14 04:02:11,459 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:02:11,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 04:02:11,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:02:11,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 04:02:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2024-11-14 04:02:11,461 INFO L87 Difference]: Start difference. First operand 14722 states and 59375 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:02:33,482 INFO L93 Difference]: Finished difference Result 45436 states and 187118 transitions. [2024-11-14 04:02:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:02:33,484 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 04:02:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:02:33,787 INFO L225 Difference]: With dead ends: 45436 [2024-11-14 04:02:33,787 INFO L226 Difference]: Without dead ends: 42881 [2024-11-14 04:02:33,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=364, Invalid=1528, Unknown=0, NotChecked=0, Total=1892 [2024-11-14 04:02:33,816 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 595 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:02:33,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 196 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2024-11-14 04:02:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42881 states. [2024-11-14 04:02:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42881 to 31352. [2024-11-14 04:02:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31352 states, 31343 states have (on average 4.179721149858023) internal successors, (131005), 31351 states have internal predecessors, (131005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31352 states to 31352 states and 131005 transitions. [2024-11-14 04:02:35,717 INFO L78 Accepts]: Start accepts. Automaton has 31352 states and 131005 transitions. Word has length 17 [2024-11-14 04:02:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:02:35,717 INFO L471 AbstractCegarLoop]: Abstraction has 31352 states and 131005 transitions. [2024-11-14 04:02:35,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 31352 states and 131005 transitions. [2024-11-14 04:02:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 04:02:35,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:02:35,722 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:02:35,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-11-14 04:02:35,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 04:02:36,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-14 04:02:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:02:36,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:02:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:02:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1457507548, now seen corresponding path program 2 times [2024-11-14 04:02:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:02:36,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789476388] [2024-11-14 04:02:36,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:02:36,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:02:36,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:02:36,329 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:02:36,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-14 04:02:36,412 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 04:02:36,412 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:02:36,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 04:02:36,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:36,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:02:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-14 04:02:36,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:02:36,836 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:02:36,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789476388] [2024-11-14 04:02:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789476388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:02:36,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:02:36,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:02:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336305325] [2024-11-14 04:02:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:02:36,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:02:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:02:36,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:02:36,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:02:36,838 INFO L87 Difference]: Start difference. First operand 31352 states and 131005 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:02:38,122 INFO L93 Difference]: Finished difference Result 40287 states and 167478 transitions. [2024-11-14 04:02:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:02:38,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 04:02:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:02:38,352 INFO L225 Difference]: With dead ends: 40287 [2024-11-14 04:02:38,352 INFO L226 Difference]: Without dead ends: 37732 [2024-11-14 04:02:38,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 04:02:38,365 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 79 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:02:38,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 13 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:02:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37732 states. [2024-11-14 04:02:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37732 to 27489. [2024-11-14 04:02:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27489 states, 27480 states have (on average 4.0802765647743815) internal successors, (112126), 27488 states have internal predecessors, (112126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27489 states to 27489 states and 112126 transitions. [2024-11-14 04:02:39,584 INFO L78 Accepts]: Start accepts. Automaton has 27489 states and 112126 transitions. Word has length 18 [2024-11-14 04:02:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:02:39,584 INFO L471 AbstractCegarLoop]: Abstraction has 27489 states and 112126 transitions. [2024-11-14 04:02:39,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27489 states and 112126 transitions. [2024-11-14 04:02:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 04:02:39,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:02:39,589 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:02:39,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-11-14 04:02:39,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:02:39,790 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:02:39,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:02:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1763155095, now seen corresponding path program 2 times [2024-11-14 04:02:39,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:02:39,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661426537] [2024-11-14 04:02:39,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:02:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:02:39,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:02:39,793 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:02:39,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-14 04:02:39,916 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:02:39,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:02:39,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 04:02:39,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:02:40,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:02:40,431 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:02:40,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661426537] [2024-11-14 04:02:40,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661426537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:40,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1460932788] [2024-11-14 04:02:40,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:02:40,432 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:02:40,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:02:40,433 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:02:40,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-14 04:02:40,637 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:02:40,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:02:40,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 04:02:40,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:02:40,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:02:40,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1460932788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:40,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294557558] [2024-11-14 04:02:40,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:02:40,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:02:40,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:02:40,839 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:02:40,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-14 04:02:40,936 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:02:40,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:02:40,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 04:02:40,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:02:41,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:02:41,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294557558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:41,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:02:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 7] total 13 [2024-11-14 04:02:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670123138] [2024-11-14 04:02:41,478 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:02:41,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 04:02:41,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:02:41,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 04:02:41,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-14 04:02:41,479 INFO L87 Difference]: Start difference. First operand 27489 states and 112126 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:02:42,707 INFO L93 Difference]: Finished difference Result 27593 states and 112325 transitions. [2024-11-14 04:02:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 04:02:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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 [2024-11-14 04:02:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:02:42,870 INFO L225 Difference]: With dead ends: 27593 [2024-11-14 04:02:42,870 INFO L226 Difference]: Without dead ends: 27278 [2024-11-14 04:02:42,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-14 04:02:42,882 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 83 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:02:42,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 58 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 04:02:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27278 states. [2024-11-14 04:02:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27278 to 27271. [2024-11-14 04:02:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27271 states, 27262 states have (on average 4.082312376201306) internal successors, (111292), 27270 states have internal predecessors, (111292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27271 states to 27271 states and 111292 transitions. [2024-11-14 04:02:43,804 INFO L78 Accepts]: Start accepts. Automaton has 27271 states and 111292 transitions. Word has length 18 [2024-11-14 04:02:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:02:43,804 INFO L471 AbstractCegarLoop]: Abstraction has 27271 states and 111292 transitions. [2024-11-14 04:02:43,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:02:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27271 states and 111292 transitions. [2024-11-14 04:02:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 04:02:43,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:02:43,812 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:02:43,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2024-11-14 04:02:44,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-14 04:02:44,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2024-11-14 04:02:44,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:02:44,413 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:02:44,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:02:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash -142552059, now seen corresponding path program 3 times [2024-11-14 04:02:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:02:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351241961] [2024-11-14 04:02:44,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:02:44,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:02:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:02:44,417 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:02:44,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-14 04:02:44,617 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 04:02:44,618 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:02:44,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 04:02:44,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:44,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:02:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:02:45,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:02:49,115 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:02:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351241961] [2024-11-14 04:02:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351241961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [613362979] [2024-11-14 04:02:49,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:02:49,116 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:02:49,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:02:49,118 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:02:49,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-14 04:02:49,400 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 04:02:49,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:02:49,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 04:02:49,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:49,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:02:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:02:50,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:02:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [613362979] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:53,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722338522] [2024-11-14 04:02:53,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:02:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:02:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:02:53,386 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:02:53,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-14 04:02:53,547 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 04:02:53,547 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:02:53,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 04:02:53,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:02:53,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:02:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:02:54,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:02:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-14 04:02:56,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722338522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:02:56,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:02:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 9] total 22 [2024-11-14 04:02:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807952384] [2024-11-14 04:02:56,518 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:02:56,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 04:02:56,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:02:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 04:02:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2024-11-14 04:02:56,519 INFO L87 Difference]: Start difference. First operand 27271 states and 111292 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:03,072 INFO L93 Difference]: Finished difference Result 40031 states and 167220 transitions. [2024-11-14 04:03:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 04:03:03,074 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-14 04:03:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:03,267 INFO L225 Difference]: With dead ends: 40031 [2024-11-14 04:03:03,267 INFO L226 Difference]: Without dead ends: 38755 [2024-11-14 04:03:03,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2024-11-14 04:03:03,284 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 213 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:03,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 70 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-14 04:03:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38755 states. [2024-11-14 04:03:03,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38755 to 9357. [2024-11-14 04:03:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9357 states, 9352 states have (on average 3.9553036783575704) internal successors, (36990), 9356 states have internal predecessors, (36990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9357 states to 9357 states and 36990 transitions. [2024-11-14 04:03:03,945 INFO L78 Accepts]: Start accepts. Automaton has 9357 states and 36990 transitions. Word has length 22 [2024-11-14 04:03:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:03,946 INFO L471 AbstractCegarLoop]: Abstraction has 9357 states and 36990 transitions. [2024-11-14 04:03:03,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 23 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 9357 states and 36990 transitions. [2024-11-14 04:03:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 04:03:03,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:03,952 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1] [2024-11-14 04:03:03,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2024-11-14 04:03:04,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-14 04:03:04,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2024-11-14 04:03:04,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:03:04,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:03:04,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash -383512854, now seen corresponding path program 3 times [2024-11-14 04:03:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:03:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296435154] [2024-11-14 04:03:04,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:03:04,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:03:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:03:04,558 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:03:04,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2024-11-14 04:03:04,726 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-14 04:03:04,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:03:04,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 04:03:04,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:04,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:03:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:05,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:08,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:03:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296435154] [2024-11-14 04:03:08,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296435154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:03:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [935106590] [2024-11-14 04:03:08,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:03:08,413 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:03:08,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:03:08,415 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:03:08,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-14 04:03:08,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-14 04:03:08,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:03:08,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 04:03:08,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:08,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:03:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:09,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [935106590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:03:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269743769] [2024-11-14 04:03:09,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:03:09,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:03:09,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:03:09,823 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:03:09,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-14 04:03:10,118 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-14 04:03:10,118 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:03:10,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 04:03:10,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:10,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:03:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:10,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269743769] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:03:11,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:03:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 24 [2024-11-14 04:03:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350284507] [2024-11-14 04:03:11,128 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:03:11,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 04:03:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:03:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 04:03:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2024-11-14 04:03:11,129 INFO L87 Difference]: Start difference. First operand 9357 states and 36990 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:31,584 INFO L93 Difference]: Finished difference Result 9382 states and 37038 transitions. [2024-11-14 04:03:31,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-14 04:03:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 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 [2024-11-14 04:03:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:31,635 INFO L225 Difference]: With dead ends: 9382 [2024-11-14 04:03:31,635 INFO L226 Difference]: Without dead ends: 9381 [2024-11-14 04:03:31,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=994, Invalid=2198, Unknown=0, NotChecked=0, Total=3192 [2024-11-14 04:03:31,639 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:31,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-14 04:03:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9381 states. [2024-11-14 04:03:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9381 to 9381. [2024-11-14 04:03:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9381 states, 9376 states have (on average 3.949018771331058) internal successors, (37026), 9380 states have internal predecessors, (37026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9381 states to 9381 states and 37026 transitions. [2024-11-14 04:03:31,894 INFO L78 Accepts]: Start accepts. Automaton has 9381 states and 37026 transitions. Word has length 23 [2024-11-14 04:03:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:31,894 INFO L471 AbstractCegarLoop]: Abstraction has 9381 states and 37026 transitions. [2024-11-14 04:03:31,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 9381 states and 37026 transitions. [2024-11-14 04:03:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 04:03:31,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:31,904 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-11-14 04:03:31,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-14 04:03:32,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-11-14 04:03:32,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2024-11-14 04:03:32,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:03:32,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:03:32,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:32,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1914979160, now seen corresponding path program 2 times [2024-11-14 04:03:32,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:03:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493292780] [2024-11-14 04:03:32,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:03:32,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:03:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:03:32,509 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:03:32,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-14 04:03:32,642 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:03:32,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:03:32,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 04:03:32,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:32,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:03:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:33,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:35,138 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:03:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493292780] [2024-11-14 04:03:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493292780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:03:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1855869680] [2024-11-14 04:03:35,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:03:35,138 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:03:35,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:03:35,140 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:03:35,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-14 04:03:35,392 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:03:35,392 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:03:35,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 04:03:35,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:03:36,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:03:37,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1855869680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:03:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444214406] [2024-11-14 04:03:37,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:03:37,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:03:37,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:03:37,479 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:03:37,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-14 04:03:37,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:03:37,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:03:37,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 04:03:37,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:03:37,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:03:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 04:03:37,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444214406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:03:37,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:03:37,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 9, 9, 9] total 35 [2024-11-14 04:03:37,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920794933] [2024-11-14 04:03:37,849 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:03:37,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-14 04:03:37,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:03:37,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-14 04:03:37,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2024-11-14 04:03:37,851 INFO L87 Difference]: Start difference. First operand 9381 states and 37026 transitions. Second operand has 36 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:03:56,627 INFO L93 Difference]: Finished difference Result 30279 states and 120495 transitions. [2024-11-14 04:03:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 04:03:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 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 [2024-11-14 04:03:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:03:56,766 INFO L225 Difference]: With dead ends: 30279 [2024-11-14 04:03:56,767 INFO L226 Difference]: Without dead ends: 25544 [2024-11-14 04:03:56,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=457, Invalid=3083, Unknown=0, NotChecked=0, Total=3540 [2024-11-14 04:03:56,785 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 776 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 4521 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 4533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:03:56,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 482 Invalid, 4533 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 4521 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2024-11-14 04:03:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25544 states. [2024-11-14 04:03:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25544 to 16059. [2024-11-14 04:03:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16059 states, 16054 states have (on average 3.95041734147253) internal successors, (63420), 16058 states have internal predecessors, (63420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16059 states to 16059 states and 63420 transitions. [2024-11-14 04:03:57,393 INFO L78 Accepts]: Start accepts. Automaton has 16059 states and 63420 transitions. Word has length 26 [2024-11-14 04:03:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:03:57,394 INFO L471 AbstractCegarLoop]: Abstraction has 16059 states and 63420 transitions. [2024-11-14 04:03:57,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4166666666666665) internal successors, (87), 35 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:03:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16059 states and 63420 transitions. [2024-11-14 04:03:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 04:03:57,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:03:57,413 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:03:57,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2024-11-14 04:03:57,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-14 04:03:57,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2024-11-14 04:03:58,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:03:58,014 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:03:58,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:03:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1166236159, now seen corresponding path program 2 times [2024-11-14 04:03:58,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:03:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754894355] [2024-11-14 04:03:58,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:03:58,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:03:58,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:03:58,017 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:03:58,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-11-14 04:03:58,160 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:03:58,160 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:03:58,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-14 04:03:58,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:03:58,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:03:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:03:58,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:00,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:04:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754894355] [2024-11-14 04:04:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754894355] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:04:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1082614591] [2024-11-14 04:04:00,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:04:00,757 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:04:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:04:00,758 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:04:00,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2024-11-14 04:04:01,009 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:04:01,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:04:01,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 04:04:01,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:04:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 04:04:02,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 04:04:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1082614591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:04:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182361896] [2024-11-14 04:04:03,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 04:04:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:04:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:04:03,291 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:04:03,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-14 04:04:03,434 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-14 04:04:03,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:04:03,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-14 04:04:03,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:04:03,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-14 04:04:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:04:04,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:04:06,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182361896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:04:06,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-14 04:04:06,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 8, 9, 9] total 48 [2024-11-14 04:04:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315638459] [2024-11-14 04:04:06,416 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-14 04:04:06,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-14 04:04:06,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 04:04:06,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-14 04:04:06,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2123, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 04:04:06,418 INFO L87 Difference]: Start difference. First operand 16059 states and 63420 transitions. Second operand has 49 states, 49 states have (on average 2.5306122448979593) internal successors, (124), 48 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:04:31,680 INFO L93 Difference]: Finished difference Result 27671 states and 109279 transitions. [2024-11-14 04:04:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 04:04:31,682 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5306122448979593) internal successors, (124), 48 states have internal predecessors, (124), 0 states have call successors, (0), 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 [2024-11-14 04:04:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:04:31,791 INFO L225 Difference]: With dead ends: 27671 [2024-11-14 04:04:31,791 INFO L226 Difference]: Without dead ends: 23872 [2024-11-14 04:04:31,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=513, Invalid=4179, Unknown=0, NotChecked=0, Total=4692 [2024-11-14 04:04:31,805 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 655 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 4828 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:04:31,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 501 Invalid, 4846 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 4828 Invalid, 0 Unknown, 0 Unchecked, 19.8s Time] [2024-11-14 04:04:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23872 states. [2024-11-14 04:04:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23872 to 15834. [2024-11-14 04:04:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15834 states, 15829 states have (on average 3.944848063680586) internal successors, (62443), 15833 states have internal predecessors, (62443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15834 states to 15834 states and 62443 transitions. [2024-11-14 04:04:32,322 INFO L78 Accepts]: Start accepts. Automaton has 15834 states and 62443 transitions. Word has length 28 [2024-11-14 04:04:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:04:32,322 INFO L471 AbstractCegarLoop]: Abstraction has 15834 states and 62443 transitions. [2024-11-14 04:04:32,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5306122448979593) internal successors, (124), 48 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:04:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 15834 states and 62443 transitions. [2024-11-14 04:04:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 04:04:32,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:04:32,337 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 04:04:32,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2024-11-14 04:04:32,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2024-11-14 04:04:32,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2024-11-14 04:04:32,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-14 04:04:32,938 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:04:32,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:04:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 666925226, now seen corresponding path program 1 times [2024-11-14 04:04:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 04:04:32,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450119666] [2024-11-14 04:04:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:32,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 04:04:32,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 04:04:32,943 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 04:04:32,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2024-11-14 04:04:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:33,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:04:33,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:04:33,810 INFO L378 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 64 treesize of output 62 [2024-11-14 04:04:33,822 INFO L378 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 62 treesize of output 60 [2024-11-14 04:04:34,313 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-14 04:04:34,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 58 [2024-11-14 04:04:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:34,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:35,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:04:35,668 INFO L378 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 159 treesize of output 115 [2024-11-14 04:04:35,683 INFO L378 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 72 treesize of output 70 [2024-11-14 04:04:35,697 INFO L378 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 70 treesize of output 68 [2024-11-14 04:04:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:44,581 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 04:04:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450119666] [2024-11-14 04:04:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450119666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:04:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [202094844] [2024-11-14 04:04:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:04:44,582 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-14 04:04:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-14 04:04:44,584 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-14 04:04:44,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c8666c-2815-4707-a44a-130e8b0251b2/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2024-11-14 04:04:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:04:44,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:04:44,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:04:45,149 INFO L378 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 15 treesize of output 1 [2024-11-14 04:04:46,046 INFO L378 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 64 treesize of output 62 [2024-11-14 04:04:46,053 INFO L378 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 62 treesize of output 60 [2024-11-14 04:04:46,405 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-14 04:04:46,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 58 [2024-11-14 04:04:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:04:46,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:04:47,038 INFO L378 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 96 treesize of output 94 [2024-11-14 04:04:47,068 INFO L378 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 94 treesize of output 92 [2024-11-14 04:05:06,575 INFO L378 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 197 treesize of output 183 [2024-11-14 04:05:06,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:05:06,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 294 treesize of output 322 [2024-11-14 04:07:01,910 WARN L873 $PredicateComparison]: unable to prove that (or (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse6 (= (_ bv0 32) .cse0))) (let ((.cse17 (not .cse6)) (.cse19 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (or (not (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts1~0) (_ bv0 32))) (= (_ bv0 32) (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts3~0))))) (.cse23 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (let ((.cse465 (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts3~0))) (or (bvslt .cse465 (_ bv0 32)) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts1~0) (_ bv0 32))) (= (_ bv0 32) .cse465)))))) (let ((.cse128 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse463 (bvmul (_ bv4 32) v_prenex_3)) (.cse462 (bvmul (_ bv4 32) v_prenex_4)) (.cse464 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse462 .cse463) (= (_ bv0 32) .cse464) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse463)) (= .cse462 .cse464) (not (bvslt v_prenex_3 c_~N~0)))))) (.cse27 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse461 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse461) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse461)) (not (bvslt v_prenex_3 c_~N~0)))))) (.cse121 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_18 c_~mts1~0) (_ bv0 32))) (bvslt (bvadd v_arrayElimCell_18 c_~mts3~0) (_ bv0 32))))) (.cse9 (forall ((v_arrayElimCell_19 (_ BitVec 32))) (not (bvslt (bvadd v_arrayElimCell_19 c_~mts1~0) (_ bv0 32))))) (.cse78 (and .cse19 .cse23)) (.cse4 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (or (not (bvslt (_ bv0 32) (bvadd v_arrayElimCell_21 c_~mts2~0 c_~sum~0))) (bvslt (bvadd v_arrayElimCell_21 c_~mts3~0) (_ bv0 32))))) (.cse191 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_21 c_~mts1~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd v_arrayElimCell_21 c_~mts2~0 c_~sum~0))) (bvslt (bvadd v_arrayElimCell_21 c_~mts3~0) (_ bv0 32))))) (.cse101 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse460 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse460 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse460) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse460 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse460 .cse0))))) (.cse148 (forall ((v_prenex_3 (_ BitVec 32))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 (bvmul (_ bv4 32) v_prenex_3))) (not (bvslt v_prenex_3 c_~N~0))))) (.cse140 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (or (not (bvslt (_ bv0 32) (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts3~0) (_ bv0 32))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts1~0) (_ bv0 32)))))) (.cse15 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (not (bvslt (bvadd v_arrayElimCell_21 c_~mts1~0) (_ bv0 32))))) (.cse30 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (bvslt (bvadd v_arrayElimCell_18 c_~mts3~0) (_ bv0 32)))) (.cse21 (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse459 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse459 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse459) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse459 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse307 (or .cse17 .cse23)) (.cse65 (forall ((v_arrayElimCell_20 (_ BitVec 32))) (not (bvslt (bvadd v_arrayElimCell_20 c_~mts1~0) (_ bv0 32))))) (.cse91 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (let ((.cse458 (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts3~0))) (or (bvslt .cse458 (_ bv0 32)) (= (_ bv0 32) .cse458))))) (.cse241 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse455 (bvmul (_ bv4 32) v_prenex_4)) (.cse457 (bvmul ~M~0 (_ bv4 32))) (.cse456 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse455 (_ bv0 32)) (= .cse455 .cse456) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse457) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse455) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse455 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse457 .cse456))))) (.cse61 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts1~0) (_ bv0 32))))) (.cse99 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse454 (bvadd v_arrayElimCell_21 c_~mts3~0))) (or (= (_ bv0 32) .cse454) (bvslt .cse454 (_ bv0 32))))))) (let ((.cse13 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse451 (bvmul (_ bv4 32) v_prenex_4)) (.cse452 (bvmul (_ bv4 32) v_prenex_3)) (.cse453 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse451 (_ bv0 32)) (= .cse451 .cse452) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse453) (not (bvsge ~M~0 (_ bv0 32))) (= .cse453 .cse452) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse453) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse453))) (not (= .cse0 .cse453)))))) (.cse53 (forall ((v_prenex_4 (_ BitVec 32))) (or (not (bvslt v_prenex_4 c_~N~0)) (not (let ((.cse450 (bvmul (_ bv4 32) v_prenex_4))) (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse450) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse450 (_ bv4 32))))) (not (bvsge v_prenex_4 (_ bv0 32)))))) (.cse74 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse448 (bvmul (_ bv4 32) v_prenex_4)) (.cse449 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse448 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse448) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse448 (_ bv4 32)))) (= .cse448 .cse449) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse449 (bvmul (_ bv4 32) v_prenex_3)))))) (.cse80 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse445 (bvmul (_ bv4 32) v_prenex_4)) (.cse447 (bvmul ~M~0 (_ bv4 32))) (.cse446 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse445 .cse446) (= (_ bv0 32) .cse447) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse445 .cse447) (= .cse0 .cse446) (not (bvslt v_prenex_3 c_~N~0)))))) (.cse51 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse443 (bvmul (_ bv4 32) v_prenex_4)) (.cse444 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse443 (_ bv0 32)) (= .cse443 .cse444) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse444) (not (bvslt v_prenex_3 c_~N~0)))))) (.cse92 (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse440 (bvmul (_ bv4 32) v_prenex_4)) (.cse442 (bvmul ~M~0 (_ bv4 32))) (.cse441 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse440 (_ bv0 32)) (= .cse440 .cse441) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse442) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse440) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse440 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse440 .cse0) (= (_ bv0 32) .cse441) (= .cse442 .cse441)))) .cse99)) (.cse28 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse439 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse439) (not (bvslt v_prenex_3 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse439))))) (.cse29 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse438 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse438)) (not (bvslt v_prenex_3 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse438))))) (.cse25 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse437 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse437) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse437) (not (bvslt v_prenex_3 c_~N~0)))))) (.cse5 (or .cse61 .cse17)) (.cse155 (forall ((v_prenex_3 (_ BitVec 32))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_3 c_~N~0))))) (.cse127 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse435 (bvmul ~M~0 (_ bv4 32))) (.cse436 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse435) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse436)) (not (bvslt v_prenex_3 c_~N~0)) (= .cse435 .cse436))))) (.cse18 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse432 (bvmul (_ bv4 32) v_prenex_4)) (.cse434 (bvmul ~M~0 (_ bv4 32))) (.cse433 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse432 .cse433) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse434) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse432) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse432 (_ bv4 32)))) (= .cse432 .cse434) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse432 .cse0) (= (_ bv0 32) .cse433) (= .cse434 .cse433))))) (.cse146 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse429 (bvmul (_ bv4 32) v_prenex_4)) (.cse430 (bvmul ~M~0 (_ bv4 32))) (.cse431 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse429 (_ bv0 32)) (not (= .cse429 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse430) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse429) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse429 (_ bv4 32)))) (= .cse429 .cse430) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse431) (= .cse430 .cse431))))) (.cse189 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse426 (bvmul (_ bv4 32) v_prenex_4)) (.cse428 (bvmul ~M~0 (_ bv4 32))) (.cse427 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse426 .cse427) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse428) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse426) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse426 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse426 .cse0) (= (_ bv0 32) .cse427) (= .cse428 .cse427))))) (.cse171 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse423 (bvmul (_ bv4 32) v_prenex_4)) (.cse425 (bvmul ~M~0 (_ bv4 32))) (.cse424 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse423 (_ bv0 32)) (= .cse423 .cse424) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse425) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse423) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse423 (_ bv4 32)))) (= .cse423 .cse425) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse425 .cse424))))) (.cse162 (or .cse241 .cse99)) (.cse67 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse420 (bvmul (_ bv4 32) v_prenex_4)) (.cse421 (bvmul (_ bv4 32) v_prenex_3)) (.cse422 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse420 .cse421) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse422) (= .cse420 .cse422) (not (bvsge ~M~0 (_ bv0 32))) (= .cse422 .cse421) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse422) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse422))) (not (= .cse0 .cse422)))))) (.cse66 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse417 (bvmul (_ bv4 32) v_prenex_4)) (.cse418 (bvmul (_ bv4 32) v_prenex_3)) (.cse419 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse417 .cse418) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse419) (= .cse417 .cse419) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse418) (= .cse419 .cse418) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse419) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse419))) (not (= .cse0 .cse419)))))) (.cse68 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse415 (bvmul (_ bv4 32) v_prenex_3)) (.cse416 (bvmul ~M~0 (_ bv4 32)))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse415) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse416) (not (bvsge ~M~0 (_ bv0 32))) (= .cse416 .cse415) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse416) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse416))) (not (= .cse0 .cse416)))))) (.cse141 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse414 (bvmul ~M~0 (_ bv4 32))) (.cse412 (bvmul (_ bv4 32) v_prenex_4)) (.cse413 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse412 .cse413) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse414) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse412) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse412 (_ bv4 32)))) (= .cse412 .cse414) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse412 .cse0) (= (_ bv0 32) .cse413))))) (.cse212 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse410 (bvmul (_ bv4 32) v_prenex_4)) (.cse411 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse410 (_ bv0 32)) (= .cse410 .cse411) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse410) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse410 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse410 .cse0) (= (_ bv0 32) .cse411))))) (.cse181 (and .cse307 (or .cse65 .cse6 .cse91))) (.cse153 (forall ((~M~0 (_ BitVec 32))) (let ((.cse409 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse409) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse409) (not (bvsge ~M~0 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse409) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse409))))))) (.cse109 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse406 (bvmul (_ bv4 32) v_prenex_4)) (.cse408 (bvmul ~M~0 (_ bv4 32))) (.cse407 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse406 (_ bv0 32)) (= .cse406 .cse407) (= (_ bv0 32) .cse408) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse407) (not (bvslt v_prenex_3 c_~N~0)) (= .cse408 .cse407))))) (.cse41 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse403 (bvmul (_ bv4 32) v_prenex_4)) (.cse405 (bvmul ~M~0 (_ bv4 32))) (.cse404 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse403 (_ bv0 32)) (= .cse403 .cse404) (= (_ bv0 32) .cse405) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse404)) (not (bvslt v_prenex_3 c_~N~0)) (= .cse405 .cse404))))) (.cse170 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse400 (bvmul (_ bv4 32) v_prenex_4)) (.cse401 (bvmul (_ bv4 32) v_prenex_3)) (.cse402 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse400 .cse401) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse402) (= .cse400 .cse402) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse401) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse402) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse402))) (not (= .cse0 .cse402)))))) (.cse143 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse398 (bvmul (_ bv4 32) v_prenex_4)) (.cse399 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse398 .cse399) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse398) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse398 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse398 .cse0) (= (_ bv0 32) .cse399))))) (.cse120 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse396 (bvmul (_ bv4 32) v_prenex_4)) (.cse397 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse396 .cse397) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse396) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse396 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse397))))) (.cse201 (or .cse21 .cse23)) (.cse77 (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse395 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse395 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse395) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse395 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse52 (or .cse21 .cse30)) (.cse81 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (or (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts3~0) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts1~0) (_ bv0 32)))))) (.cse69 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_21 c_~mts1~0) (_ bv0 32))) (bvslt (bvadd v_arrayElimCell_21 c_~mts3~0) (_ bv0 32))))) (.cse16 (forall ((~M~0 (_ BitVec 32))) (let ((.cse394 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse394) (not (bvsge ~M~0 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse394) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse394))) (not (= .cse0 .cse394)))))) (.cse202 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse391 (bvmul (_ bv4 32) v_prenex_4)) (.cse393 (bvmul ~M~0 (_ bv4 32))) (.cse392 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse391 .cse392) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse393) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse391) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse391 (_ bv4 32)))) (= .cse391 .cse393) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse392))))) (.cse182 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse388 (bvmul (_ bv4 32) v_prenex_4)) (.cse390 (bvmul ~M~0 (_ bv4 32))) (.cse389 (bvmul (_ bv4 32) v_prenex_3))) (or (not (= .cse388 .cse0)) (= .cse388 .cse389) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse390) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse388) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse388 (_ bv4 32)))) (= .cse388 .cse390) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse389))))) (.cse126 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse386 (bvmul (_ bv4 32) v_prenex_4)) (.cse387 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse386) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse386 (_ bv4 32)))) (= .cse386 .cse387) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse387 (bvmul (_ bv4 32) v_prenex_3)))))) (.cse160 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse385 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse384 (bvmul (_ bv4 32) v_prenex_4))) (or (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse384) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse384 (_ bv4 32)))) (= .cse384 .cse385) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse384 .cse0)))) (= .cse385 (bvmul (_ bv4 32) v_prenex_3)))))) (.cse227 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse381 (bvmul (_ bv4 32) v_prenex_4)) (.cse383 (bvmul ~M~0 (_ bv4 32))) (.cse382 (bvmul (_ bv4 32) v_prenex_3))) (or (not (= .cse381 .cse0)) (= .cse381 .cse382) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse383) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse381) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse381 (_ bv4 32)))) (= .cse381 .cse383) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse382) (= .cse383 .cse382))))) (.cse251 (forall ((v_arrayElimCell_20 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_20 c_~mts1~0) (_ bv0 32))) (= (_ bv0 32) (bvadd v_arrayElimCell_20 c_~mts3~0))))) (.cse247 (forall ((v_arrayElimCell_20 (_ BitVec 32))) (let ((.cse380 (bvadd v_arrayElimCell_20 c_~mts3~0))) (or (not (bvslt (bvadd v_arrayElimCell_20 c_~mts1~0) (_ bv0 32))) (bvslt .cse380 (_ bv0 32)) (= (_ bv0 32) .cse380))))) (.cse22 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse377 (bvmul (_ bv4 32) v_prenex_4)) (.cse379 (bvmul ~M~0 (_ bv4 32))) (.cse378 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse377 .cse378) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse379) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse377) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse377 (_ bv4 32)))) (= .cse377 .cse379) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse378) (= .cse379 .cse378))))) (.cse161 (forall ((~M~0 (_ BitVec 32))) (let ((.cse374 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse374) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse375 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse374 .cse375) (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse376 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse376 .cse0)) (= .cse376 .cse375) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse376) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse376 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))))))))) (.cse190 (and (forall ((~M~0 (_ BitVec 32))) (let ((.cse368 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse368) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse369 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse368 .cse369) (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse370 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse370 .cse369) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse370) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse370 (_ bv4 32)))) (= .cse370 .cse368) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse370 .cse0)))))))))) (forall ((~M~0 (_ BitVec 32))) (let ((.cse371 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse371) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse373 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse372 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse372 .cse373) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse372) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse372 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse372 .cse0)))) (= .cse371 .cse373))))))))) (.cse237 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse365 (bvmul (_ bv4 32) v_prenex_4)) (.cse367 (bvmul ~M~0 (_ bv4 32))) (.cse366 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse365 .cse366) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse367) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse365) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse365 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse367 .cse366))))) (.cse238 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse362 (bvmul (_ bv4 32) v_prenex_4)) (.cse364 (bvmul ~M~0 (_ bv4 32))) (.cse363 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse362 .cse363) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse364) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse362) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse362 (_ bv4 32)))) (= .cse362 .cse364) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse364 .cse363))))) (.cse236 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse359 (bvmul (_ bv4 32) v_prenex_4)) (.cse361 (bvmul ~M~0 (_ bv4 32))) (.cse360 (bvmul (_ bv4 32) v_prenex_3))) (or (not (= .cse359 .cse0)) (= .cse359 .cse360) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse361) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse359) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse359 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse361 .cse360))))) (.cse82 (forall ((~M~0 (_ BitVec 32))) (let ((.cse358 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse358) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse358))) (not (= .cse0 .cse358)))))) (.cse195 (and .cse307 (or .cse15 .cse6 .cse91))) (.cse194 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse356 (bvmul (_ bv4 32) v_prenex_4)) (.cse357 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse356 (_ bv0 32)) (not (= .cse356 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse356) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse356 (_ bv4 32)))) (= .cse356 .cse357) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse357 (bvmul (_ bv4 32) v_prenex_3)))))) (.cse219 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse355 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse355 (_ bv0 32)) (not (= .cse355 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse355) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse355 (_ bv4 32)))) (= .cse355 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse110 (or .cse148 .cse140)) (.cse46 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse353 (bvmul ~M~0 (_ bv4 32))) (.cse354 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse353) (not (bvsge v_prenex_3 (_ bv0 32))) (= (bvmul (_ bv4 32) v_prenex_4) .cse353) (= .cse0 .cse354) (not (bvslt v_prenex_3 c_~N~0)) (= .cse353 .cse354))))) (.cse196 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse350 (bvmul (_ bv4 32) v_prenex_4)) (.cse352 (bvmul ~M~0 (_ bv4 32))) (.cse351 (bvmul (_ bv4 32) v_prenex_3))) (or (not (= .cse350 .cse0)) (= .cse350 .cse351) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse352) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse350) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse350 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse351) (= .cse352 .cse351))))) (.cse134 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (let ((.cse349 (bvadd v_arrayElimCell_21 c_~mts3~0))) (or (= (_ bv0 32) .cse349) (not (bvslt (bvadd v_arrayElimCell_21 c_~mts1~0) (_ bv0 32))) (bvslt .cse349 (_ bv0 32)))))) (.cse200 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse346 (bvmul (_ bv4 32) v_prenex_4)) (.cse348 (bvmul ~M~0 (_ bv4 32))) (.cse347 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse346 .cse347) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse348) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse346) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse346 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse347) (= .cse348 .cse347))))) (.cse142 (and (forall ((~M~0 (_ BitVec 32))) (let ((.cse344 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse344) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse345 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse345 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse345) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse345 (_ bv4 32)))) (= .cse345 .cse344) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse345 .cse0))))))) .cse101)) (.cse167 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse342 (bvmul (_ bv4 32) v_prenex_4)) (.cse343 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse342 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse343) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse342) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse342 (_ bv4 32)))) (= .cse342 .cse343) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse117 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (or (= (_ bv0 32) (bvadd v_arrayElimCell_18 c_~mts3~0)) (not (bvslt (bvadd v_arrayElimCell_18 c_~mts1~0) (_ bv0 32)))))) (.cse166 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse341 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse341 .cse0)) (= .cse341 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse341) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse341 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse230 (forall ((~M~0 (_ BitVec 32))) (let ((.cse340 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse340) (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32))) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse340) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse340))))))) (.cse85 (and (or .cse61 .cse4 .cse17) (or .cse191 .cse6))) (.cse277 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse339 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse339) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse339) (not (bvslt v_prenex_3 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse339))))) (.cse24 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_21 c_~mts1~0) (_ bv0 32))) (not (bvslt (bvadd v_arrayElimCell_21 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd v_arrayElimCell_21 c_~mts2~0 c_~sum~0)))))) (.cse213 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse338 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse338) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse338)) (not (bvslt v_prenex_3 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse338))))) (.cse135 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse337 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse337 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse337) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse337 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse104 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse335 (bvmul (_ bv4 32) v_prenex_4)) (.cse336 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse335 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse336) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse335) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse335 (_ bv4 32)))) (= .cse335 .cse336) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse47 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_18 c_~mts3~0) (_ bv0 32))) (not (bvslt (bvadd v_arrayElimCell_18 c_~mts1~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd v_arrayElimCell_18 c_~mts2~0 c_~sum~0)))))) (.cse273 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse332 (bvmul (_ bv4 32) v_prenex_4)) (.cse334 (bvmul ~M~0 (_ bv4 32))) (.cse333 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse332 .cse333) (= (_ bv0 32) .cse334) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse333)) (= .cse332 .cse334) (not (bvslt v_prenex_3 c_~N~0)) (= .cse334 .cse333))))) (.cse211 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse331 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse331 (_ bv0 32)) (= .cse331 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse331) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse331 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse199 (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse330 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse330 (_ bv0 32)) (not (= .cse330 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse330) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse330 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse31 (and (or .cse9 .cse6 .cse91) (or .cse78 .cse17))) (.cse73 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse328 (bvmul (_ bv4 32) v_prenex_4)) (.cse329 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse328 (_ bv0 32)) (= .cse328 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse329) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse328) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse328 (_ bv4 32)))) (= .cse328 .cse329) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse20 (forall ((v_arrayElimCell_20 (_ BitVec 32))) (let ((.cse327 (bvadd v_arrayElimCell_20 c_~mts3~0))) (or (bvslt .cse327 (_ bv0 32)) (= (_ bv0 32) .cse327))))) (.cse217 (and (or .cse30 .cse17 .cse23) (or .cse6 .cse91 .cse121))) (.cse197 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse326 (bvmul (_ bv4 32) v_prenex_4))) (or (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse326) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse326 (_ bv4 32)))) (= .cse326 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse198 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse325 (bvmul (_ bv4 32) v_prenex_4))) (or (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse325) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse325 (_ bv4 32)))) (= .cse325 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse325 .cse0))))) (.cse54 (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse324 (bvmul (_ bv4 32) v_prenex_4))) (or (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse324) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse324 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse324 .cse0))))) (.cse239 (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse323 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse323 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse323) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse323 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse323 .cse0))))) (.cse8 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse322 (bvadd v_arrayElimCell_18 c_~mts3~0))) (or (= (_ bv0 32) .cse322) (bvslt .cse322 (_ bv0 32)))))) (.cse152 (or .cse140 .cse27)) (.cse285 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse319 (bvmul (_ bv4 32) v_prenex_4)) (.cse321 (bvmul ~M~0 (_ bv4 32))) (.cse320 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse319 .cse320) (= (_ bv0 32) .cse321) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse319 .cse321) (= .cse0 .cse320) (not (bvslt v_prenex_3 c_~N~0)) (= .cse321 .cse320))))) (.cse79 (or .cse128 .cse140)) (.cse40 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_18 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd v_arrayElimCell_18 c_~mts2~0 c_~sum~0)))))) (.cse286 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse318 (bvmul ~M~0 (_ bv4 32))) (.cse317 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse317) (= (_ bv0 32) .cse318) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse317) (not (bvslt v_prenex_3 c_~N~0)) (= .cse318 .cse317))))) (.cse119 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (let ((.cse316 (bvadd v_arrayElimCell_18 c_~mts3~0))) (or (= (_ bv0 32) .cse316) (not (bvslt (bvadd v_arrayElimCell_18 c_~mts1~0) (_ bv0 32))) (bvslt .cse316 (_ bv0 32)))))) (.cse45 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse315 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse315 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse315) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse315 (_ bv4 32)))) (= .cse315 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32))))))) (.cse12 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (bvslt (bvadd v_arrayElimCell_21 c_~mts3~0) (_ bv0 32)))) (.cse282 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse312 (bvmul (_ bv4 32) v_prenex_4)) (.cse313 (bvmul (_ bv4 32) v_prenex_3)) (.cse314 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse312 (_ bv0 32)) (= .cse312 .cse313) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse314) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse313) (= .cse314 .cse313) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse314) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse314))) (not (= .cse0 .cse314)))))) (.cse14 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (or (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts3~0) (_ bv0 32)) (not (bvslt (_ bv0 32) (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts2~0 c_~sum~0)))))) (.cse75 (forall ((v_arrayElimCell_21 (_ BitVec 32))) (or (not (bvslt (bvadd v_arrayElimCell_21 c_~mts3~0) (_ bv0 32))) (not (bvslt (_ bv0 32) (bvadd v_arrayElimCell_21 c_~mts2~0 c_~sum~0)))))) (.cse26 (forall ((|ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| (_ BitVec 32))) (or (not (bvslt (_ bv0 32) (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts2~0 c_~sum~0))) (not (bvslt (bvadd |ULTIMATE.start_create_fresh_int_array_#t~nondet28#1| c_~mts3~0) (_ bv0 32)))))) (.cse50 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse310 (bvmul (_ bv4 32) v_prenex_4)) (.cse311 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse310 (_ bv0 32)) (= .cse310 .cse311) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse311)) (not (bvslt v_prenex_3 c_~N~0)))))) (.cse118 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse308 (bvmul (_ bv4 32) v_prenex_4)) (.cse309 (bvmul (_ bv4 32) v_prenex_3))) (or (not (= .cse308 .cse0)) (= .cse308 .cse309) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse308) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse308 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse309))))) (.cse7 (forall ((v_arrayElimCell_18 (_ BitVec 32))) (not (bvslt (bvadd v_arrayElimCell_18 c_~mts1~0) (_ bv0 32)))))) (and (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse2 (bvmul (_ bv4 32) v_prenex_4)) (.cse3 (bvmul (_ bv4 32) v_prenex_3)) (.cse1 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse1) (= .cse2 .cse3) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse1) (= .cse2 .cse1) (not (bvsge ~M~0 (_ bv0 32))) (= .cse1 .cse3) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse1) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse1)))))) .cse4 (and .cse5 (or .cse6 .cse7))) (or .cse8 .cse9 .cse6 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse11 (bvmul ~M~0 (_ bv4 32))) (.cse10 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse10 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse11) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse10) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse10 (_ bv4 32)))) (= .cse10 .cse11) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse10 .cse0))))) (or .cse12 .cse13 .cse7 .cse14) (or .cse13 .cse7 .cse14) (or .cse15 .cse16 .cse14) (or .cse17 (and (or .cse18 .cse19 .cse20) (or (and .cse21 (or .cse22 .cse20)) .cse23))) (or .cse6 (and (or .cse24 .cse25) (or .cse26 .cse15 .cse27))) (or (and (or .cse24 .cse28) (or .cse29 .cse26 .cse15)) .cse6) (or .cse30 .cse31 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse32 (bvmul (_ bv4 32) v_prenex_4)) (.cse33 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse32 (_ bv0 32)) (not (= .cse32 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse33) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse32) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse32 (_ bv4 32)))) (= .cse32 .cse33) (not (bvsge v_prenex_4 (_ bv0 32))))))) (or .cse15 .cse6 (and (or .cse26 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse34 (bvmul (_ bv4 32) v_prenex_4)) (.cse36 (bvmul ~M~0 (_ bv4 32))) (.cse35 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse34 (_ bv0 32)) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse35)) (= .cse34 .cse36) (not (bvslt v_prenex_3 c_~N~0)) (= .cse36 .cse35))))) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse37 (bvmul (_ bv4 32) v_prenex_4)) (.cse38 (bvmul ~M~0 (_ bv4 32))) (.cse39 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse37 (_ bv0 32)) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse37 .cse38) (= .cse0 .cse39) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse39) (= .cse38 .cse39)))) .cse40))) (or (and (or .cse41 .cse26) (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse42 (bvmul (_ bv4 32) v_prenex_4)) (.cse44 (bvmul ~M~0 (_ bv4 32))) (.cse43 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse42 (_ bv0 32)) (= .cse42 .cse43) (= (_ bv0 32) .cse44) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse43) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse43) (= .cse44 .cse43)))) .cse40)) .cse9 .cse6) (or .cse8 .cse17 (and (or .cse45 .cse19) (or .cse45 .cse23))) (or .cse6 (and (or .cse46 .cse47) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse48 (bvmul ~M~0 (_ bv4 32))) (.cse49 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse48) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse49)) (= (bvmul (_ bv4 32) v_prenex_4) .cse48) (not (bvslt v_prenex_3 c_~N~0)) (= .cse48 .cse49)))) .cse26 .cse7))) (or (and (or .cse26 .cse15 .cse50) (or .cse24 .cse51)) .cse6) (or .cse17 (and (or (and .cse52 (or .cse8 .cse53)) .cse23) (or .cse8 .cse19 .cse54))) (or .cse9 .cse6 (and (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse55 (bvmul (_ bv4 32) v_prenex_4)) (.cse56 (bvmul ~M~0 (_ bv4 32))) (.cse57 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse55 (_ bv0 32)) (= (_ bv0 32) .cse56) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse57)) (= .cse55 .cse56) (not (bvslt v_prenex_3 c_~N~0)) (= .cse56 .cse57)))) .cse26) (or .cse40 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse58 (bvmul (_ bv4 32) v_prenex_4)) (.cse59 (bvmul ~M~0 (_ bv4 32))) (.cse60 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse58 (_ bv0 32)) (= (_ bv0 32) .cse59) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse58 .cse59) (= .cse0 .cse60) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse60) (= .cse59 .cse60))))))) (or .cse61 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse62 (bvmul (_ bv4 32) v_prenex_4)) (.cse64 (bvmul (_ bv4 32) v_prenex_3)) (.cse63 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse62 (_ bv0 32)) (= .cse0 .cse63) (= .cse62 .cse64) (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32))) (= .cse63 .cse64) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse63) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse63)))))) .cse4 .cse17) (or (and (or .cse65 .cse12 .cse66) (or .cse12 .cse67 .cse7) (or .cse68 .cse69)) .cse14) (or (and (or .cse9 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse72 (bvmul ~M~0 (_ bv4 32))) (.cse70 (bvmul (_ bv4 32) v_prenex_4)) (.cse71 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse70 (_ bv0 32)) (= .cse70 .cse71) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse72) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse70) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse70 (_ bv4 32)))) (= .cse70 .cse72) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse70 .cse0) (= (_ bv0 32) .cse71)))) .cse6) (or .cse61 .cse17 .cse73)) .cse20) (or .cse8 .cse17 (and (or .cse74 .cse23) (or .cse74 .cse19))) (or .cse61 .cse75 .cse17 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse76 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse76) (= (bvmul ~M~0 (_ bv4 32)) .cse76))))) (or .cse77 .cse8 .cse78 .cse17) (or (and .cse79 (or .cse61 .cse75 .cse80)) .cse17) (or .cse81 .cse17 .cse82) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse84 (bvmul (_ bv4 32) v_prenex_3)) (.cse83 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse83) (= (bvmul (_ bv4 32) v_prenex_4) .cse84) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse83) (not (bvsge ~M~0 (_ bv0 32))) (= .cse83 .cse84) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse83) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse83)))))) .cse85) (or .cse8 .cse61 .cse17 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse87 (bvmul (_ bv4 32) v_prenex_4)) (.cse86 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse86) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse87) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse87 (_ bv4 32)))) (= .cse87 .cse86) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse87 .cse0) (= .cse86 (bvmul (_ bv4 32) v_prenex_3)))))) (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse88 (bvmul (_ bv4 32) v_prenex_4)) (.cse90 (bvmul ~M~0 (_ bv4 32))) (.cse89 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse88 (_ bv0 32)) (not (= .cse88 .cse0)) (= .cse88 .cse89) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse90) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse88) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse88 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse90 .cse89)))) .cse7 .cse91) (or (and .cse92 (or (and (forall ((~M~0 (_ BitVec 32))) (let ((.cse94 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse93 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse93) (= .cse94 .cse93) (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse95 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse95 .cse0)) (= .cse95 .cse93) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse95) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse95 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))))))))) (= (_ bv0 32) .cse94)))) (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse96 (bvmul (_ bv4 32) v_prenex_4)) (.cse98 (bvmul ~M~0 (_ bv4 32))) (.cse97 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse96 (_ bv0 32)) (= .cse96 .cse97) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse98) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse96) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse96 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse97) (= .cse98 .cse97)))) .cse99)) .cse91)) .cse9 .cse6) (or .cse61 .cse17 (and (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse100 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse100 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse100) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse100 (_ bv4 32)))) (= .cse100 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse100 .cse0)))) .cse20) (or .cse101 .cse99))) (or .cse8 (and (forall ((~M~0 (_ BitVec 32))) (let ((.cse103 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse102 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse102 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse102) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse102 (_ bv4 32)))) (= .cse102 .cse103) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse102 .cse0)))) (= (_ bv0 32) .cse103)))) (or .cse104 .cse91)) .cse9 .cse6) (or .cse4 (and (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse105 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse105) (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32))) (= .cse105 (bvmul (_ bv4 32) v_prenex_3)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse105) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse105)))))) .cse61 .cse17) (or .cse6 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse106 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse106) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse106) (= (bvmul (_ bv4 32) v_prenex_4) .cse106) (not (bvsge ~M~0 (_ bv0 32))) (= .cse106 (bvmul (_ bv4 32) v_prenex_3)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse106) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse106)))))) .cse7) (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse108 (bvmul (_ bv4 32) v_prenex_3)) (.cse107 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse107) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse107) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse108) (= .cse107 .cse108) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse107) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse107)))))) .cse9 .cse6))) (or (and (or .cse61 .cse40 .cse109) .cse110) .cse17) (or .cse8 .cse15 .cse6 (and (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse111 (bvmul (_ bv4 32) v_prenex_4)) (.cse112 (bvmul ~M~0 (_ bv4 32))) (.cse113 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse111 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse111) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse111 (_ bv4 32)))) (= .cse111 .cse112) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse113) (= .cse112 .cse113)))) .cse91) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse116 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse115 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse114 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse114 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse114) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse114 (_ bv4 32)))) (= .cse114 .cse115) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse114 .cse0)))) (= .cse115 .cse116)))) (= (_ bv0 32) .cse116)))))) (or (and (or .cse117 .cse118) (or .cse119 .cse120)) .cse6 .cse91) (or (and (or .cse119 .cse54) (or (and (or .cse21 .cse121) (or .cse119 .cse53)) .cse91)) .cse6) (or .cse21 .cse17 .cse23) (or .cse119 (and (or .cse74 .cse91) (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse123 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse122 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse122 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse122) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse122 (_ bv4 32)))) (= .cse122 .cse123) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse122 .cse0)))) (= .cse123 (bvmul (_ bv4 32) v_prenex_3)))))) .cse6) (or .cse8 (and (or .cse19 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse124 (bvmul (_ bv4 32) v_prenex_4)) (.cse125 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse124) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse124 (_ bv4 32)))) (= .cse124 .cse125) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse124 .cse0) (= .cse125 (bvmul (_ bv4 32) v_prenex_3)))))) (or .cse126 .cse23)) .cse17) (or .cse26 .cse15 .cse127 .cse6) (or .cse6 (and (or .cse128 .cse26 .cse15) (or .cse24 .cse80))) (or (and (or .cse61 .cse51 .cse75) .cse110) .cse17) (or (and .cse21 (forall ((~M~0 (_ BitVec 32))) (let ((.cse129 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse129) (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse130 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse130 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse130) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse130 (_ bv4 32)))) (= .cse130 .cse129) (not (bvsge v_prenex_4 (_ bv0 32)))))))))) .cse15 .cse6 .cse91) (or .cse9 .cse6 (and .cse92 (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse131 (bvmul (_ bv4 32) v_prenex_4)) (.cse133 (bvmul ~M~0 (_ bv4 32))) (.cse132 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse131 (_ bv0 32)) (= .cse131 .cse132) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse133) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse131) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse131 (_ bv4 32)))) (= .cse131 .cse133) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse131 .cse0) (= (_ bv0 32) .cse132) (= .cse133 .cse132)))) .cse20))) (or .cse134 (and (or .cse135 .cse91) .cse101) .cse6) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse136 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse136) (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse136) (= (bvmul ~M~0 (_ bv4 32)) .cse136)))) .cse61 .cse40 .cse17) (or .cse20 (let ((.cse138 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse139 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse139 (_ bv0 32)) (= .cse139 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse139) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse139 (_ bv4 32)))) (= .cse139 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32)))))))) (and (or .cse15 .cse6 (and (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse137 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse137 (_ bv0 32)) (= .cse137 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse137) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse137 (_ bv4 32)))) (= .cse137 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse137 .cse0)))) (or .cse138 .cse91))) (or (and (or .cse138 .cse19) (or .cse138 .cse23)) .cse17)))) (or (and (or .cse61 .cse28 .cse75) (or .cse29 .cse140)) .cse17) (or .cse61 (and (or .cse141 .cse20) (or .cse8 .cse142) (or .cse8 .cse143)) .cse17) (or .cse61 .cse4 .cse17 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse145 (bvmul (_ bv4 32) v_prenex_3)) (.cse144 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse144) (= (bvmul (_ bv4 32) v_prenex_4) .cse145) (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse145) (= .cse144 .cse145) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse144) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse144))))))) (or .cse30 .cse146 .cse9 .cse91) (or (and (or (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse147 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse147) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse147)))) .cse75) (or .cse148 .cse26)) .cse9 .cse6) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse149 (bvmul (_ bv4 32) v_prenex_4)) (.cse151 (bvmul (_ bv4 32) v_prenex_3)) (.cse150 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse149 (_ bv0 32)) (= .cse0 .cse150) (= .cse149 .cse151) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse150) (not (bvsge ~M~0 (_ bv0 32))) (= .cse150 .cse151) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse150) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse150)))))) .cse4 .cse6 .cse7) (or (and .cse152 (or .cse61 .cse75 .cse25)) .cse17) (or (and .cse5 (or .cse9 .cse6)) .cse4 .cse153) (or .cse16 .cse69 .cse14) (or .cse61 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse154 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse154) (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse154)))) .cse75 .cse17) (or (and (or .cse24 .cse155) (or .cse148 .cse26 .cse15)) .cse6) (or .cse26 .cse15 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse157 (bvmul ~M~0 (_ bv4 32))) (.cse156 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse156) (= (_ bv0 32) .cse157) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse156)) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse156) (= .cse157 .cse156))))) (or .cse8 .cse61 (and (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse159 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse158 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse158 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse158) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse158 (_ bv4 32)))) (= .cse158 .cse159) (not (bvsge v_prenex_4 (_ bv0 32)))))) (= .cse159 (bvmul (_ bv4 32) v_prenex_3))))) .cse160) .cse17) (or .cse6 (and (or (and .cse161 .cse162) .cse91) (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse163 (bvmul (_ bv4 32) v_prenex_4)) (.cse165 (bvmul ~M~0 (_ bv4 32))) (.cse164 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse163 (_ bv0 32)) (= .cse163 .cse164) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse165) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse163) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse163 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse163 .cse0) (= .cse165 .cse164)))) .cse99)) .cse7) (or .cse17 (and (or .cse8 .cse142 .cse19) (or (and (or .cse30 .cse166) (or .cse8 .cse167) (or .cse8 .cse135)) .cse23) (or .cse166 .cse23))) (or .cse17 (and (or .cse61 .cse155 .cse75) .cse110)) (or .cse9 .cse6 (and (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse168 (bvmul ~M~0 (_ bv4 32))) (.cse169 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse168) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse169) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse169) (= .cse168 .cse169)))) .cse75) (or .cse26 .cse127))) (or (and (or .cse65 .cse12 .cse170) (or .cse16 .cse69)) .cse14) (or (and (or .cse78 .cse171 .cse17) (or .cse6 (and (or .cse171 .cse91) (forall ((~M~0 (_ BitVec 32))) (let ((.cse172 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse172) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse174 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse173 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse173 (_ bv0 32)) (= .cse173 .cse174) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse173) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse173 (_ bv4 32)))) (= .cse173 .cse172) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse173 .cse0)))) (= .cse172 .cse174)))))))) .cse7) (or .cse9 (and (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse175 (bvmul (_ bv4 32) v_prenex_4)) (.cse177 (bvmul ~M~0 (_ bv4 32))) (.cse176 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse175 (_ bv0 32)) (= .cse175 .cse176) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse177) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse175) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse175 (_ bv4 32)))) (= .cse175 .cse177) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse176) (= .cse177 .cse176)))) .cse91) (forall ((~M~0 (_ BitVec 32))) (let ((.cse180 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse179 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse178 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse178 (_ bv0 32)) (= .cse178 .cse179) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse178) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse178 (_ bv4 32)))) (= .cse178 .cse180) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse178 .cse0)))) (= (_ bv0 32) .cse179) (= .cse180 .cse179)))) (= (_ bv0 32) .cse180))))) .cse6)) .cse20) (or .cse181 .cse182) (or .cse9 .cse91 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse183 (bvmul (_ bv4 32) v_prenex_4)) (.cse185 (bvmul ~M~0 (_ bv4 32))) (.cse184 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse183 (_ bv0 32)) (not (= .cse183 .cse0)) (= .cse183 .cse184) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse185) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse183) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse183 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse184) (= .cse185 .cse184))))) (or .cse8 .cse9 .cse6 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse186 (bvmul (_ bv4 32) v_prenex_4)) (.cse187 (bvmul ~M~0 (_ bv4 32))) (.cse188 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse186 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse187) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse186) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse186 (_ bv4 32)))) (= .cse186 .cse187) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse186 .cse0) (= (_ bv0 32) .cse188) (= .cse187 .cse188))))) (or (and (or .cse189 .cse99) (or .cse18 .cse20) (or .cse8 .cse190)) .cse61 .cse17) (or .cse191 .cse6 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse193 (bvmul (_ bv4 32) v_prenex_3)) (.cse192 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse192) (= (bvmul (_ bv4 32) v_prenex_4) .cse193) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse192) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse193) (= .cse192 .cse193) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse192) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse192))))))) (or .cse194 .cse91 .cse121) (or .cse21 .cse30 .cse17 .cse23) (or .cse195 .cse196) (or .cse8 (and (or .cse197 .cse23) (or .cse198 .cse19)) .cse17) (or .cse9 .cse16 .cse14) (or .cse199 .cse31) (or .cse146 .cse9 .cse91) (or .cse17 (and (or (and (or .cse189 .cse19) (or .cse200 .cse23)) .cse99) .cse201)) (or .cse61 (and (or .cse171 .cse20) .cse162) .cse17) (or .cse195 .cse166) (or .cse148 .cse26 .cse15 .cse6) (or (and (or .cse67 .cse7) (or .cse65 .cse66) (or .cse15 .cse68)) .cse14) (or (and (or (and .cse21 (or .cse202 .cse20)) .cse23) (or .cse141 .cse19 .cse20)) .cse17) (or .cse16 (and (or .cse9 .cse14) (or .cse15 .cse14))) (or .cse8 .cse9 (and (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse203 (bvmul (_ bv4 32) v_prenex_4)) (.cse204 (bvmul ~M~0 (_ bv4 32))) (.cse205 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse203 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse204) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse203) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse203 (_ bv4 32)))) (= .cse203 .cse204) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse205) (= .cse204 .cse205)))) .cse91) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse208 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse207 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse206 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse206 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse206) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse206 (_ bv4 32)))) (= .cse206 .cse207) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse206 .cse0)))) (= (_ bv0 32) .cse207) (= .cse207 .cse208)))) (= (_ bv0 32) .cse208))))) .cse6) (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse209 (bvmul (_ bv4 32) v_prenex_4)) (.cse210 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse209 (_ bv0 32)) (not (= .cse209 .cse0)) (= .cse209 .cse210) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse209) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse209 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse210)))) .cse9 .cse91) (or .cse8 (and (or .cse61 .cse17 .cse211) (or .cse212 .cse9 .cse6))) (or (and (or .cse213 .cse26) (or .cse40 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse214 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse214) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse214) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse214) (= (bvmul ~M~0 (_ bv4 32)) .cse214)))))) .cse15 .cse6) (or .cse9 (and (or .cse212 .cse8) (or (and .cse118 (or .cse8 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse215 (bvmul (_ bv4 32) v_prenex_4)) (.cse216 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse215 (_ bv0 32)) (= .cse215 .cse216) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse215) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse215 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse216)))))) .cse91)) .cse6) (or .cse217 (and (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse218 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse218 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse218) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse218 (_ bv4 32)))) (= .cse218 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32)))))) .cse219)) (or .cse61 .cse40 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse220 (bvmul (_ bv4 32) v_prenex_4)) (.cse221 (bvmul ~M~0 (_ bv4 32))) (.cse222 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse220 (_ bv0 32)) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse220 .cse221) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse222) (= .cse221 .cse222)))) .cse17) (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse223 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse223 (_ bv0 32)) (not (= .cse223 .cse0)) (= .cse223 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse223) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse223 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32)))))) .cse7 .cse91) (or .cse30 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse224 (bvmul (_ bv4 32) v_prenex_4)) (.cse225 (bvmul ~M~0 (_ bv4 32))) (.cse226 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse224 (_ bv0 32)) (not (= .cse224 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse224) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse224 (_ bv4 32)))) (= .cse224 .cse225) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse226) (= .cse225 .cse226)))) .cse15 .cse91) (or .cse227 .cse181) (or (and .cse21 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse228 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse228) (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse229 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse229 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse229) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse229 (_ bv4 32)))) (= .cse229 .cse228) (not (bvsge v_prenex_4 (_ bv0 32)))))) (= .cse228 (bvmul (_ bv4 32) v_prenex_3)))))) .cse6 .cse7 .cse91) (or (and (or .cse230 .cse61 .cse17) (or .cse9 .cse6 .cse153) (or .cse65 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse232 (bvmul (_ bv4 32) v_prenex_4)) (.cse233 (bvmul (_ bv4 32) v_prenex_3)) (.cse231 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse231) (= .cse232 .cse233) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse231) (= .cse232 .cse231) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse233) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse231) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse231)))))) .cse6)) .cse4) (or (and (or .cse47 .cse109) (or .cse41 .cse26 .cse7)) .cse6) (or (and (or .cse15 .cse6 .cse14) (or .cse81 .cse17)) .cse82) (or (and (or .cse15 .cse16) (or .cse65 .cse170)) .cse14) (or (and (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse234 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse234) (= (bvmul (_ bv4 32) v_prenex_4) .cse234) (not (bvsge ~M~0 (_ bv0 32))) (= .cse234 (bvmul (_ bv4 32) v_prenex_3)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse234) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse234))) (not (= .cse0 .cse234))))) .cse7) (or .cse15 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse235 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse235) (not (bvsge ~M~0 (_ bv0 32))) (= .cse235 (bvmul (_ bv4 32) v_prenex_3)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse235) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse235))) (not (= .cse0 .cse235))))))) .cse14) (or (and .cse198 .cse45) .cse8 .cse61 .cse17) (or (and (or .cse8 (and (or .cse143 .cse19) (or .cse120 .cse23))) .cse201) .cse17) (or (and (or .cse236 .cse23) (or .cse8 .cse190 .cse19) (or (and (or .cse8 .cse237) (or .cse30 .cse236) (or .cse8 .cse238)) .cse23)) .cse17) (or (and (or (and (or .cse77 .cse8) .cse52) .cse91) (or .cse8 .cse239)) .cse9 .cse6) (or (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse240 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse240) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse240)) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse240)))) .cse26 .cse15) (or .cse78 .cse241 .cse17 .cse99) (or .cse9 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse243 (bvmul (_ bv4 32) v_prenex_3)) (.cse242 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse242) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse243) (= .cse242 .cse243) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse242) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse242))) (not (= .cse0 .cse242))))) .cse14) (or (and (or .cse12 .cse81 .cse17) (or .cse6 .cse69 .cse14)) .cse82) (or .cse65 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse245 (bvmul (_ bv4 32) v_prenex_4)) (.cse246 (bvmul (_ bv4 32) v_prenex_3)) (.cse244 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse0 .cse244) (= .cse245 .cse246) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse244) (= .cse245 .cse244) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse246) (= .cse244 .cse246) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse244) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse244)))))) .cse4 .cse6) (or .cse12 .cse9 .cse16 .cse14) (or (and (or .cse247 (and (or .cse202 .cse91) (forall ((~M~0 (_ BitVec 32))) (let ((.cse248 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse248) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse249 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse249) (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse250 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse250 .cse249) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse250) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse250 (_ bv4 32)))) (= .cse250 .cse248) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse250 .cse0)))))))))))) (or .cse182 .cse251 .cse91)) .cse6) (or .cse119 (and (or .cse126 .cse91) .cse160) .cse6) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse252 (bvmul (_ bv4 32) v_prenex_4)) (.cse254 (bvmul (_ bv4 32) v_prenex_3)) (.cse253 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse252 (_ bv0 32)) (= .cse0 .cse253) (= .cse252 .cse254) (not (bvslt ~M~0 c_~N~0)) (= (_ bv0 32) .cse253) (not (bvsge ~M~0 (_ bv0 32))) (= (_ bv0 32) .cse254) (= .cse253 .cse254) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse253) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (_ bv4 32) .cse253)))))) .cse9 .cse4 .cse6) (or (and (or .cse227 .cse251 .cse91) (or .cse247 (and (or .cse22 .cse91) (forall ((~M~0 (_ BitVec 32))) (let ((.cse255 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse255) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse256 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse256) (= .cse255 .cse256) (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse257 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse257 .cse256) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse257) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse257 (_ bv4 32)))) (= .cse257 .cse255) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse257 .cse0))))))))))))) .cse6) (or .cse6 (and (or (and .cse161 (forall ((~M~0 (_ BitVec 32))) (let ((.cse258 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse258) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse260 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse259 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse259 .cse0)) (= .cse259 .cse260) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse259) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse259 (_ bv4 32)))) (= .cse259 .cse258) (not (bvsge v_prenex_4 (_ bv0 32)))))) (= .cse258 .cse260)))))))) .cse7 .cse91) (or .cse119 .cse190) (or (and (or .cse119 .cse237) (or .cse119 .cse238) (or .cse236 .cse121) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse261 (bvmul (_ bv4 32) v_prenex_4)) (.cse263 (bvmul ~M~0 (_ bv4 32))) (.cse262 (bvmul (_ bv4 32) v_prenex_3))) (or (not (= .cse261 .cse0)) (= .cse261 .cse262) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse263) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse261) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse261 (_ bv4 32)))) (= .cse261 .cse263) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse263 .cse262)))) .cse121)) .cse91))) (or .cse15 .cse6 .cse14 .cse82) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse264 (bvmul (_ bv4 32) v_prenex_4)) (.cse265 (bvmul ~M~0 (_ bv4 32)))) (or (not (= .cse264 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse265) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse264) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse264 (_ bv4 32)))) (= .cse264 .cse265) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse265 (bvmul (_ bv4 32) v_prenex_3))))) .cse6 .cse91 .cse121) (or .cse195 (and .cse21 .cse199 .cse194 .cse219)) (or .cse17 (and .cse110 (or .cse46 .cse61 .cse40))) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse266 (bvmul (_ bv4 32) v_prenex_4)) (.cse267 (bvmul ~M~0 (_ bv4 32)))) (or (not (= .cse266 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse267) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse266) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse266 (_ bv4 32)))) (= .cse266 .cse267) (not (bvsge v_prenex_4 (_ bv0 32)))))) .cse6 .cse91 .cse121) (or .cse6 (and (or (forall ((v_arrayElimCell_21 (_ BitVec 32))) (or (= (_ bv0 32) (bvadd v_arrayElimCell_21 c_~mts3~0)) (not (bvslt (bvadd v_arrayElimCell_21 c_~mts1~0) (_ bv0 32))))) .cse196) (or .cse134 .cse200)) .cse91) (or .cse6 (and (or .cse7 (and (forall ((~M~0 (_ BitVec 32))) (let ((.cse268 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse268) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse269 (bvmul (_ bv4 32) v_prenex_4))) (or (not (= .cse269 .cse0)) (= .cse269 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse269) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse269 (_ bv4 32)))) (= .cse269 .cse268) (not (bvsge v_prenex_4 (_ bv0 32))))))))) .cse166) .cse91) (or .cse119 .cse142) (or (and (or .cse166 .cse121) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse270 (bvmul (_ bv4 32) v_prenex_4)) (.cse271 (bvmul ~M~0 (_ bv4 32)))) (or (not (= .cse270 .cse0)) (= .cse270 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse271) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse270) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse270 (_ bv4 32)))) (= .cse270 .cse271) (not (bvsge v_prenex_4 (_ bv0 32)))))) .cse121) (or .cse119 .cse135) (or .cse119 .cse167)) .cse91))) (or .cse6 (and (or (and (or .cse117 .cse166) (or .cse119 .cse211)) .cse91) (or .cse119 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse272 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse272 (_ bv0 32)) (= .cse272 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse272) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse272 (_ bv4 32)))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse272 .cse0))))))) (or .cse65 (and (or .cse273 .cse26) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse274 (bvmul (_ bv4 32) v_prenex_4)) (.cse276 (bvmul ~M~0 (_ bv4 32))) (.cse275 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse274 .cse275) (= (_ bv0 32) .cse276) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse274 .cse276) (= .cse0 .cse275) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse275) (= .cse276 .cse275)))) .cse40)) .cse6) (or (and (or .cse213 .cse140) (or .cse277 .cse61 .cse75)) .cse17) (or .cse230 .cse85) (or (and (or .cse277 .cse24) (or .cse213 .cse26 .cse15)) .cse6) (or (and (or .cse19 .cse101) (or .cse135 .cse23)) .cse17 .cse99) (or .cse8 .cse78 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse278 (bvmul (_ bv4 32) v_prenex_4)) (.cse279 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse278 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse279) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse278) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse278 (_ bv4 32)))) (= .cse278 .cse279) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse279 (bvmul (_ bv4 32) v_prenex_3))))) .cse17) (or .cse61 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse281 (bvmul ~M~0 (_ bv4 32))) (.cse280 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse280) (= (_ bv0 32) .cse281) (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse280) (= .cse281 .cse280)))) .cse40 .cse17) (or .cse8 .cse78 .cse104 .cse17) (or .cse9 .cse282 .cse14) (or (and (or .cse26 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse284 (bvmul ~M~0 (_ bv4 32))) (.cse283 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_4) .cse283) (= (_ bv0 32) .cse284) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse0 .cse283)) (not (bvslt v_prenex_3 c_~N~0)) (= .cse284 .cse283)))) .cse7) (or .cse285 .cse47) (or .cse47 .cse286) (or .cse273 .cse26 .cse7)) .cse6) (or .cse8 .cse78 .cse17 .cse211) (or (and .cse199 (forall ((~M~0 (_ BitVec 32))) (let ((.cse288 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse287 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse287 (_ bv0 32)) (not (= .cse287 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse287) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse287 (_ bv4 32)))) (= .cse287 .cse288) (not (bvsge v_prenex_4 (_ bv0 32)))))) (= (_ bv0 32) .cse288))))) .cse31) (or (and (or .cse78 .cse17 .cse73) (or .cse6 .cse7 (and (or .cse73 .cse91) (forall ((~M~0 (_ BitVec 32))) (let ((.cse289 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse289) (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse290 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse290 (_ bv0 32)) (= .cse290 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse290) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse290 (_ bv4 32)))) (= .cse290 .cse289) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse290 .cse0))))))))) (or .cse9 (and (forall ((~M~0 (_ BitVec 32))) (let ((.cse293 (bvmul ~M~0 (_ bv4 32)))) (or (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse292 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_4 (_ BitVec 32))) (let ((.cse291 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse291 (_ bv0 32)) (= .cse291 .cse292) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse291) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse291 (_ bv4 32)))) (= .cse291 .cse293) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse291 .cse0)))) (= (_ bv0 32) .cse292)))) (= (_ bv0 32) .cse293)))) (or (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse294 (bvmul (_ bv4 32) v_prenex_4)) (.cse296 (bvmul ~M~0 (_ bv4 32))) (.cse295 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse294 (_ bv0 32)) (= .cse294 .cse295) (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse296) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse294) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse294 (_ bv4 32)))) (= .cse294 .cse296) (not (bvsge v_prenex_4 (_ bv0 32))) (= (_ bv0 32) .cse295)))) .cse91)) .cse6)) .cse20) (or .cse217 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse297 (bvmul (_ bv4 32) v_prenex_4)) (.cse298 (bvmul ~M~0 (_ bv4 32)))) (or (not (= .cse297 .cse0)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse297) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse297 (_ bv4 32)))) (= .cse297 .cse298) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse298 (bvmul (_ bv4 32) v_prenex_3)))))) (or .cse119 .cse6 (and (or .cse197 .cse91) .cse198)) (or .cse65 .cse6 (and (or .cse75 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse299 (bvmul (_ bv4 32) v_prenex_4)) (.cse301 (bvmul ~M~0 (_ bv4 32))) (.cse300 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse299 .cse300) (= (_ bv0 32) .cse301) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse299 .cse301) (= .cse0 .cse300) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse300))))) (or .cse128 .cse26))) (or .cse8 (and (or .cse61 .cse17 .cse54) (or .cse9 .cse6 .cse239))) (or .cse8 .cse61 .cse17 (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse302 (bvmul ~M~0 (_ bv4 32))) (.cse303 (bvmul (_ bv4 32) v_prenex_4))) (or (not (bvslt v_prenex_4 c_~N~0)) (= (_ bv0 32) .cse302) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse303) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse303 (_ bv4 32)))) (= .cse303 .cse302) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse303 .cse0))))) (or (and .cse152 (or .cse61 .cse40 .cse285) .cse79 (or .cse61 .cse40 .cse286)) .cse17) (or .cse119 (and (or .cse45 .cse91) (forall ((v_prenex_4 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse304 (bvmul (_ bv4 32) v_prenex_4))) (or (= .cse304 (_ bv0 32)) (not (bvslt v_prenex_4 c_~N~0)) (not (bvule (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse304) (bvadd |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| .cse304 (_ bv4 32)))) (= .cse304 (bvmul ~M~0 (_ bv4 32))) (not (bvsge v_prenex_4 (_ bv0 32))) (= .cse304 .cse0))))) .cse6) (or .cse12 .cse9 .cse282 .cse14) (or (and (or .cse75 (forall ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse305 (bvmul (_ bv4 32) v_prenex_4)) (.cse306 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse305 (_ bv0 32)) (= .cse305 .cse306) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse0 .cse306) (not (bvslt v_prenex_3 c_~N~0)) (= (_ bv0 32) .cse306))))) (or .cse26 .cse50)) .cse9 .cse6) (or .cse118 (and .cse307 (or .cse6 .cse7 .cse91)))))))))) is different from true