./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/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_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:39:43,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:39:43,326 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:39:43,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:39:43,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:39:43,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:39:43,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:39:43,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:39:43,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:39:43,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:39:43,375 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:39:43,375 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:39:43,375 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:39:43,376 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:39:43,376 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:39:43,376 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:39:43,376 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:39:43,376 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:39:43,376 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:39:43,377 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:39:43,377 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:39:43,377 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:39:43,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:39:43,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:39:43,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:39:43,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:39:43,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:39:43,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:39:43,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:39:43,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:39:43,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:39:43,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:39:43,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:39:43,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:39:43,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:39:43,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:39:43,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:39:43,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:39:43,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:39:43,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:39:43,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:39:43,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:39:43,381 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:39:43,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:39:43,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:39:43,382 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:39:43,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:39:43,382 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_d610aeff-2f41-43f3-a273-2009ba14dde8/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 ! call(reach_error())) ) 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 -> c031a4ce44fce05276ee0c322906dbff86776176e55e116d257d2b83e85a253c [2024-11-14 05:39:43,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:39:43,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:39:43,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:39:43,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:39:43,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:39:43,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c Unable to find full path for "g++" [2024-11-14 05:39:45,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:39:46,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:39:46,163 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c [2024-11-14 05:39:46,173 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/data/dfe88907e/cf297b7fc34f43c5ae90d04223185bc9/FLAG6daa6e0d4 [2024-11-14 05:39:46,192 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/data/dfe88907e/cf297b7fc34f43c5ae90d04223185bc9 [2024-11-14 05:39:46,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:39:46,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:39:46,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:39:46,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:39:46,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:39:46,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4d69d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46, skipping insertion in model container [2024-11-14 05:39:46,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:39:46,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-14 05:39:46,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:39:46,553 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:39:46,610 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/sv-benchmarks/c/weaver/popl20-more-buffer-series3.wvr.c[4403,4416] [2024-11-14 05:39:46,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:39:46,635 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:39:46,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46 WrapperNode [2024-11-14 05:39:46,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:39:46,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:39:46,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:39:46,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:39:46,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,726 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 333 [2024-11-14 05:39:46,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:39:46,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:39:46,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:39:46,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:39:46,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:39:46,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:39:46,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:39:46,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:39:46,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (1/1) ... [2024-11-14 05:39:46,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:39:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:39:46,873 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:39:46,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:39:46,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:39:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:39:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:39:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-14 05:39:46,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-14 05:39:46,918 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-14 05:39:46,918 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-14 05:39:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-14 05:39:46,919 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-14 05:39:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-14 05:39:46,920 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-14 05:39:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:39:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 05:39:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 05:39:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:39:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:39:46,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:39:46,922 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 05:39:47,129 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:39:47,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:39:47,901 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 05:39:47,903 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:39:48,518 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:39:48,519 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-14 05:39:48,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:39:48 BoogieIcfgContainer [2024-11-14 05:39:48,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:39:48,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:39:48,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:39:48,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:39:48,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:39:46" (1/3) ... [2024-11-14 05:39:48,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3376053f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:39:48, skipping insertion in model container [2024-11-14 05:39:48,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:39:46" (2/3) ... [2024-11-14 05:39:48,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3376053f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:39:48, skipping insertion in model container [2024-11-14 05:39:48,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:39:48" (3/3) ... [2024-11-14 05:39:48,535 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2024-11-14 05:39:48,589 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:39:48,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 46 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2024-11-14 05:39:48,593 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 05:39:48,700 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-14 05:39:48,752 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 52 transitions, 132 flow [2024-11-14 05:39:49,266 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4530 states, 4529 states have (on average 4.3473172885846765) internal successors, (19689), 4529 states have internal predecessors, (19689), 0 states have call successors, (0), 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 05:39:49,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:39:49,318 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=LoopHeads, 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;@130027b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:39:49,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-14 05:39:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 4530 states, 4529 states have (on average 4.3473172885846765) internal successors, (19689), 4529 states have internal predecessors, (19689), 0 states have call successors, (0), 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 05:39:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:39:49,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:49,424 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, 1] [2024-11-14 05:39:49,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:39:49,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1587894290, now seen corresponding path program 1 times [2024-11-14 05:39:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812598824] [2024-11-14 05:39:49,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:49,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:50,099 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 05:39:50,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812598824] [2024-11-14 05:39:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812598824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:50,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:39:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165932182] [2024-11-14 05:39:50,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:50,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:50,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:50,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:50,171 INFO L87 Difference]: Start difference. First operand has 4530 states, 4529 states have (on average 4.3473172885846765) internal successors, (19689), 4529 states have internal predecessors, (19689), 0 states have call successors, (0), 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, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:50,803 INFO L93 Difference]: Finished difference Result 7058 states and 30790 transitions. [2024-11-14 05:39:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-14 05:39:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:50,961 INFO L225 Difference]: With dead ends: 7058 [2024-11-14 05:39:50,961 INFO L226 Difference]: Without dead ends: 6948 [2024-11-14 05:39:50,973 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 05:39:50,977 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:50,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:39:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2024-11-14 05:39:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 5895. [2024-11-14 05:39:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5895 states, 5894 states have (on average 4.355446216491347) internal successors, (25671), 5894 states have internal predecessors, (25671), 0 states have call successors, (0), 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 05:39:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5895 states to 5895 states and 25671 transitions. [2024-11-14 05:39:51,632 INFO L78 Accepts]: Start accepts. Automaton has 5895 states and 25671 transitions. Word has length 30 [2024-11-14 05:39:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:51,634 INFO L471 AbstractCegarLoop]: Abstraction has 5895 states and 25671 transitions. [2024-11-14 05:39:51,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:39:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5895 states and 25671 transitions. [2024-11-14 05:39:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:39:51,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:51,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, 1, 1, 1, 1] [2024-11-14 05:39:51,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:39:51,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:39:51,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:51,668 INFO L85 PathProgramCache]: Analyzing trace with hash -598501784, now seen corresponding path program 1 times [2024-11-14 05:39:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260108764] [2024-11-14 05:39:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:52,082 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 05:39:52,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260108764] [2024-11-14 05:39:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260108764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:52,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:39:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093501721] [2024-11-14 05:39:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:52,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:52,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:52,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:52,085 INFO L87 Difference]: Start difference. First operand 5895 states and 25671 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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 05:39:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:53,080 INFO L93 Difference]: Finished difference Result 11198 states and 48778 transitions. [2024-11-14 05:39:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:53,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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 33 [2024-11-14 05:39:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:53,339 INFO L225 Difference]: With dead ends: 11198 [2024-11-14 05:39:53,339 INFO L226 Difference]: Without dead ends: 8041 [2024-11-14 05:39:53,349 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 05:39:53,354 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:53,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:39:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8041 states. [2024-11-14 05:39:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8041 to 7527. [2024-11-14 05:39:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7527 states, 7526 states have (on average 4.330188679245283) internal successors, (32589), 7526 states have internal predecessors, (32589), 0 states have call successors, (0), 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 05:39:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7527 states to 7527 states and 32589 transitions. [2024-11-14 05:39:53,976 INFO L78 Accepts]: Start accepts. Automaton has 7527 states and 32589 transitions. Word has length 33 [2024-11-14 05:39:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:53,977 INFO L471 AbstractCegarLoop]: Abstraction has 7527 states and 32589 transitions. [2024-11-14 05:39:53,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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 05:39:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7527 states and 32589 transitions. [2024-11-14 05:39:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:39:54,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:54,020 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, 1, 1, 1, 1] [2024-11-14 05:39:54,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:39:54,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:39:54,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1418453342, now seen corresponding path program 1 times [2024-11-14 05:39:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:54,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250718109] [2024-11-14 05:39:54,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:54,296 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 05:39:54,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250718109] [2024-11-14 05:39:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250718109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:54,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:54,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:39:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351924002] [2024-11-14 05:39:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:54,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:39:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:39:54,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:39:54,302 INFO L87 Difference]: Start difference. First operand 7527 states and 32589 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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 05:39:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:55,470 INFO L93 Difference]: Finished difference Result 13708 states and 59380 transitions. [2024-11-14 05:39:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:39:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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 33 [2024-11-14 05:39:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:55,588 INFO L225 Difference]: With dead ends: 13708 [2024-11-14 05:39:55,588 INFO L226 Difference]: Without dead ends: 10095 [2024-11-14 05:39:55,603 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 05:39:55,605 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:55,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:39:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10095 states. [2024-11-14 05:39:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10095 to 9616. [2024-11-14 05:39:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9616 states, 9615 states have (on average 4.280499219968799) internal successors, (41157), 9615 states have internal predecessors, (41157), 0 states have call successors, (0), 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 05:39:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 41157 transitions. [2024-11-14 05:39:56,657 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 41157 transitions. Word has length 33 [2024-11-14 05:39:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:56,658 INFO L471 AbstractCegarLoop]: Abstraction has 9616 states and 41157 transitions. [2024-11-14 05:39:56,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 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 05:39:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 41157 transitions. [2024-11-14 05:39:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:39:56,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:56,715 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:39:56,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:39:56,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:56,716 INFO L85 PathProgramCache]: Analyzing trace with hash 139967231, now seen corresponding path program 1 times [2024-11-14 05:39:56,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251452818] [2024-11-14 05:39:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:39:57,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251452818] [2024-11-14 05:39:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251452818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:57,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:57,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:39:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613693457] [2024-11-14 05:39:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:57,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:57,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:57,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:57,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:57,115 INFO L87 Difference]: Start difference. First operand 9616 states and 41157 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:39:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:39:58,085 INFO L93 Difference]: Finished difference Result 19593 states and 83519 transitions. [2024-11-14 05:39:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:39:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-14 05:39:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:39:58,205 INFO L225 Difference]: With dead ends: 19593 [2024-11-14 05:39:58,206 INFO L226 Difference]: Without dead ends: 12067 [2024-11-14 05:39:58,228 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 05:39:58,231 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:39:58,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 51 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:39:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12067 states. [2024-11-14 05:39:59,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12067 to 11433. [2024-11-14 05:39:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11433 states, 11432 states have (on average 4.240465360391882) internal successors, (48477), 11432 states have internal predecessors, (48477), 0 states have call successors, (0), 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 05:39:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 48477 transitions. [2024-11-14 05:39:59,473 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 48477 transitions. Word has length 37 [2024-11-14 05:39:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:39:59,475 INFO L471 AbstractCegarLoop]: Abstraction has 11433 states and 48477 transitions. [2024-11-14 05:39:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:39:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 48477 transitions. [2024-11-14 05:39:59,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:39:59,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:39:59,523 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:39:59,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:39:59,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:39:59,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:39:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -590834463, now seen corresponding path program 1 times [2024-11-14 05:39:59,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:39:59,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594488361] [2024-11-14 05:39:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:39:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:39:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:39:59,802 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 05:39:59,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:39:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594488361] [2024-11-14 05:39:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594488361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:39:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:39:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:39:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3605089] [2024-11-14 05:39:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:39:59,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:39:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:39:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:39:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:39:59,809 INFO L87 Difference]: Start difference. First operand 11433 states and 48477 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:40:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:01,052 INFO L93 Difference]: Finished difference Result 23327 states and 98449 transitions. [2024-11-14 05:40:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:40:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-14 05:40:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:01,372 INFO L225 Difference]: With dead ends: 23327 [2024-11-14 05:40:01,372 INFO L226 Difference]: Without dead ends: 13864 [2024-11-14 05:40:01,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 05:40:01,394 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:01,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 53 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:40:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13864 states. [2024-11-14 05:40:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13864 to 13064. [2024-11-14 05:40:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13064 states, 13063 states have (on average 4.215494143764832) internal successors, (55067), 13063 states have internal predecessors, (55067), 0 states have call successors, (0), 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 05:40:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13064 states to 13064 states and 55067 transitions. [2024-11-14 05:40:02,420 INFO L78 Accepts]: Start accepts. Automaton has 13064 states and 55067 transitions. Word has length 37 [2024-11-14 05:40:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:02,423 INFO L471 AbstractCegarLoop]: Abstraction has 13064 states and 55067 transitions. [2024-11-14 05:40:02,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:40:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13064 states and 55067 transitions. [2024-11-14 05:40:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 05:40:02,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:02,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:02,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:40:02,495 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:02,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1724804061, now seen corresponding path program 1 times [2024-11-14 05:40:02,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:02,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735507284] [2024-11-14 05:40:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:40:03,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:03,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735507284] [2024-11-14 05:40:03,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735507284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:03,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:03,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:40:03,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484636893] [2024-11-14 05:40:03,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:03,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:40:03,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:40:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:03,392 INFO L87 Difference]: Start difference. First operand 13064 states and 55067 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:40:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:05,351 INFO L93 Difference]: Finished difference Result 23468 states and 97771 transitions. [2024-11-14 05:40:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:40:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-14 05:40:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:05,540 INFO L225 Difference]: With dead ends: 23468 [2024-11-14 05:40:05,540 INFO L226 Difference]: Without dead ends: 19102 [2024-11-14 05:40:05,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:40:05,560 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 133 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:05,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 68 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:40:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19102 states. [2024-11-14 05:40:06,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19102 to 15562. [2024-11-14 05:40:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15562 states, 15561 states have (on average 4.236745710429921) internal successors, (65928), 15561 states have internal predecessors, (65928), 0 states have call successors, (0), 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 05:40:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15562 states to 15562 states and 65928 transitions. [2024-11-14 05:40:06,975 INFO L78 Accepts]: Start accepts. Automaton has 15562 states and 65928 transitions. Word has length 38 [2024-11-14 05:40:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:06,976 INFO L471 AbstractCegarLoop]: Abstraction has 15562 states and 65928 transitions. [2024-11-14 05:40:06,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:40:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 15562 states and 65928 transitions. [2024-11-14 05:40:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 05:40:07,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:07,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:07,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:40:07,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:07,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1013816731, now seen corresponding path program 2 times [2024-11-14 05:40:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:07,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779872375] [2024-11-14 05:40:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:07,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:40:07,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779872375] [2024-11-14 05:40:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779872375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:07,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:07,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:40:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823838026] [2024-11-14 05:40:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:40:07,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:07,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:40:07,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:07,558 INFO L87 Difference]: Start difference. First operand 15562 states and 65928 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:40:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:08,921 INFO L93 Difference]: Finished difference Result 26449 states and 110522 transitions. [2024-11-14 05:40:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:40:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-14 05:40:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:09,062 INFO L225 Difference]: With dead ends: 26449 [2024-11-14 05:40:09,062 INFO L226 Difference]: Without dead ends: 17583 [2024-11-14 05:40:09,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:40:09,084 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:09,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 60 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:40:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17583 states. [2024-11-14 05:40:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17583 to 13066. [2024-11-14 05:40:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13066 states, 13065 states have (on average 4.215078453884424) internal successors, (55070), 13065 states have internal predecessors, (55070), 0 states have call successors, (0), 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 05:40:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13066 states to 13066 states and 55070 transitions. [2024-11-14 05:40:10,120 INFO L78 Accepts]: Start accepts. Automaton has 13066 states and 55070 transitions. Word has length 38 [2024-11-14 05:40:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:10,121 INFO L471 AbstractCegarLoop]: Abstraction has 13066 states and 55070 transitions. [2024-11-14 05:40:10,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:40:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 13066 states and 55070 transitions. [2024-11-14 05:40:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 05:40:10,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:10,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:10,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:40:10,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:10,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:10,174 INFO L85 PathProgramCache]: Analyzing trace with hash -334470845, now seen corresponding path program 1 times [2024-11-14 05:40:10,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:10,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585353990] [2024-11-14 05:40:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:40:10,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585353990] [2024-11-14 05:40:10,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585353990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:10,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:10,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:40:10,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667101716] [2024-11-14 05:40:10,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:10,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:40:10,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:10,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:40:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:10,616 INFO L87 Difference]: Start difference. First operand 13066 states and 55070 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:40:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:12,042 INFO L93 Difference]: Finished difference Result 15856 states and 65412 transitions. [2024-11-14 05:40:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:40:12,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-14 05:40:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:12,140 INFO L225 Difference]: With dead ends: 15856 [2024-11-14 05:40:12,141 INFO L226 Difference]: Without dead ends: 13429 [2024-11-14 05:40:12,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:40:12,151 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 70 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:12,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 59 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:40:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13429 states. [2024-11-14 05:40:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13429 to 13067. [2024-11-14 05:40:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13067 states, 13066 states have (on average 4.214755854890556) internal successors, (55070), 13066 states have internal predecessors, (55070), 0 states have call successors, (0), 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 05:40:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13067 states to 13067 states and 55070 transitions. [2024-11-14 05:40:13,076 INFO L78 Accepts]: Start accepts. Automaton has 13067 states and 55070 transitions. Word has length 38 [2024-11-14 05:40:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:13,076 INFO L471 AbstractCegarLoop]: Abstraction has 13067 states and 55070 transitions. [2024-11-14 05:40:13,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:40:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13067 states and 55070 transitions. [2024-11-14 05:40:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:40:13,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:13,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:40:13,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -245520491, now seen corresponding path program 1 times [2024-11-14 05:40:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446347772] [2024-11-14 05:40:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:40:13,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:13,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446347772] [2024-11-14 05:40:13,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446347772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:13,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:13,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:40:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224994916] [2024-11-14 05:40:13,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:13,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:40:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:13,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:40:13,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:13,827 INFO L87 Difference]: Start difference. First operand 13067 states and 55070 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:40:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:14,806 INFO L93 Difference]: Finished difference Result 13429 states and 56276 transitions. [2024-11-14 05:40:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:40:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-14 05:40:14,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:14,895 INFO L225 Difference]: With dead ends: 13429 [2024-11-14 05:40:14,895 INFO L226 Difference]: Without dead ends: 10979 [2024-11-14 05:40:14,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:14,906 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:14,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 39 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:40:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2024-11-14 05:40:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 10862. [2024-11-14 05:40:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10862 states, 10861 states have (on average 4.239756928459626) internal successors, (46048), 10861 states have internal predecessors, (46048), 0 states have call successors, (0), 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 05:40:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10862 states to 10862 states and 46048 transitions. [2024-11-14 05:40:15,544 INFO L78 Accepts]: Start accepts. Automaton has 10862 states and 46048 transitions. Word has length 39 [2024-11-14 05:40:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:15,544 INFO L471 AbstractCegarLoop]: Abstraction has 10862 states and 46048 transitions. [2024-11-14 05:40:15,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:40:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 10862 states and 46048 transitions. [2024-11-14 05:40:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 05:40:15,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:15,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:15,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:40:15,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:15,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:15,580 INFO L85 PathProgramCache]: Analyzing trace with hash -544078095, now seen corresponding path program 1 times [2024-11-14 05:40:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188810538] [2024-11-14 05:40:15,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:40:15,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:15,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188810538] [2024-11-14 05:40:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188810538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:40:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245585301] [2024-11-14 05:40:15,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:15,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:40:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:15,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:40:15,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:15,932 INFO L87 Difference]: Start difference. First operand 10862 states and 46048 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:40:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:17,293 INFO L93 Difference]: Finished difference Result 12448 states and 52305 transitions. [2024-11-14 05:40:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:40:17,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-14 05:40:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:17,373 INFO L225 Difference]: With dead ends: 12448 [2024-11-14 05:40:17,374 INFO L226 Difference]: Without dead ends: 10017 [2024-11-14 05:40:17,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:40:17,382 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:17,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 33 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:40:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10017 states. [2024-11-14 05:40:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10017 to 8763. [2024-11-14 05:40:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8763 states, 8762 states have (on average 4.271399223921479) internal successors, (37426), 8762 states have internal predecessors, (37426), 0 states have call successors, (0), 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 05:40:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8763 states to 8763 states and 37426 transitions. [2024-11-14 05:40:18,016 INFO L78 Accepts]: Start accepts. Automaton has 8763 states and 37426 transitions. Word has length 39 [2024-11-14 05:40:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:18,017 INFO L471 AbstractCegarLoop]: Abstraction has 8763 states and 37426 transitions. [2024-11-14 05:40:18,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:40:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 8763 states and 37426 transitions. [2024-11-14 05:40:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 05:40:18,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:18,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:18,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:40:18,045 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:18,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1255457650, now seen corresponding path program 1 times [2024-11-14 05:40:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586002515] [2024-11-14 05:40:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:40:18,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:18,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586002515] [2024-11-14 05:40:18,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586002515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:18,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596361925] [2024-11-14 05:40:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:18,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:18,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:18,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:18,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:40:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:18,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 05:40:18,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:40:19,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:40:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596361925] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:40:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 8] total 16 [2024-11-14 05:40:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621493526] [2024-11-14 05:40:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:40:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:40:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-11-14 05:40:19,414 INFO L87 Difference]: Start difference. First operand 8763 states and 37426 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 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 05:40:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:21,154 INFO L93 Difference]: Finished difference Result 13020 states and 56083 transitions. [2024-11-14 05:40:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:40:21,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 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 44 [2024-11-14 05:40:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:21,246 INFO L225 Difference]: With dead ends: 13020 [2024-11-14 05:40:21,246 INFO L226 Difference]: Without dead ends: 12132 [2024-11-14 05:40:21,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-14 05:40:21,253 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 124 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:21,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 98 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:40:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12132 states. [2024-11-14 05:40:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12132 to 9484. [2024-11-14 05:40:22,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9484 states, 9483 states have (on average 4.294105240957503) internal successors, (40721), 9483 states have internal predecessors, (40721), 0 states have call successors, (0), 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 05:40:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9484 states to 9484 states and 40721 transitions. [2024-11-14 05:40:22,166 INFO L78 Accepts]: Start accepts. Automaton has 9484 states and 40721 transitions. Word has length 44 [2024-11-14 05:40:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:22,167 INFO L471 AbstractCegarLoop]: Abstraction has 9484 states and 40721 transitions. [2024-11-14 05:40:22,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 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 05:40:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 9484 states and 40721 transitions. [2024-11-14 05:40:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 05:40:22,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:22,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:22,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:40:22,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 05:40:22,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:22,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1581909558, now seen corresponding path program 1 times [2024-11-14 05:40:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:22,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481952289] [2024-11-14 05:40:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:40:22,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481952289] [2024-11-14 05:40:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481952289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:22,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079659403] [2024-11-14 05:40:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:22,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:40:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:40:22,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:40:22,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:40:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:22,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:40:22,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:40:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:40:23,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:40:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 05:40:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079659403] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 05:40:23,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:40:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 14 [2024-11-14 05:40:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614583479] [2024-11-14 05:40:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:23,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:40:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:40:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:40:23,333 INFO L87 Difference]: Start difference. First operand 9484 states and 40721 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 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 05:40:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:25,594 INFO L93 Difference]: Finished difference Result 12592 states and 53319 transitions. [2024-11-14 05:40:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:40:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 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 44 [2024-11-14 05:40:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:25,902 INFO L225 Difference]: With dead ends: 12592 [2024-11-14 05:40:25,902 INFO L226 Difference]: Without dead ends: 11393 [2024-11-14 05:40:25,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2024-11-14 05:40:25,906 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 241 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:25,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 108 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:40:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11393 states. [2024-11-14 05:40:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11393 to 9826. [2024-11-14 05:40:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9826 states, 9825 states have (on average 4.285801526717557) internal successors, (42108), 9825 states have internal predecessors, (42108), 0 states have call successors, (0), 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 05:40:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9826 states to 9826 states and 42108 transitions. [2024-11-14 05:40:26,774 INFO L78 Accepts]: Start accepts. Automaton has 9826 states and 42108 transitions. Word has length 44 [2024-11-14 05:40:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 9826 states and 42108 transitions. [2024-11-14 05:40:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 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 05:40:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 9826 states and 42108 transitions. [2024-11-14 05:40:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 05:40:26,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:26,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:26,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:40:26,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 05:40:26,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:26,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:26,999 INFO L85 PathProgramCache]: Analyzing trace with hash -492835788, now seen corresponding path program 2 times [2024-11-14 05:40:26,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:26,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804296063] [2024-11-14 05:40:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:26,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:40:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 05:40:27,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:40:27,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804296063] [2024-11-14 05:40:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804296063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:40:27,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:40:27,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:40:27,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701401230] [2024-11-14 05:40:27,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:40:27,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:40:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:40:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:40:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:40:27,271 INFO L87 Difference]: Start difference. First operand 9826 states and 42108 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 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 05:40:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:40:29,535 INFO L93 Difference]: Finished difference Result 15178 states and 65137 transitions. [2024-11-14 05:40:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:40:29,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 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 44 [2024-11-14 05:40:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:40:29,643 INFO L225 Difference]: With dead ends: 15178 [2024-11-14 05:40:29,643 INFO L226 Difference]: Without dead ends: 14399 [2024-11-14 05:40:29,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:40:29,650 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 90 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:40:29,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 110 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:40:29,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14399 states. [2024-11-14 05:40:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14399 to 9602. [2024-11-14 05:40:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9602 states, 9601 states have (on average 4.282470575981669) internal successors, (41116), 9601 states have internal predecessors, (41116), 0 states have call successors, (0), 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 05:40:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9602 states to 9602 states and 41116 transitions. [2024-11-14 05:40:30,556 INFO L78 Accepts]: Start accepts. Automaton has 9602 states and 41116 transitions. Word has length 44 [2024-11-14 05:40:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:40:30,556 INFO L471 AbstractCegarLoop]: Abstraction has 9602 states and 41116 transitions. [2024-11-14 05:40:30,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 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 05:40:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9602 states and 41116 transitions. [2024-11-14 05:40:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 05:40:30,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:40:30,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:30,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:40:30,579 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-14 05:40:30,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:40:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash -17170922, now seen corresponding path program 3 times [2024-11-14 05:40:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:40:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824583888] [2024-11-14 05:40:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:40:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:40:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:40:30,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 05:40:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 05:40:30,758 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 05:40:30,760 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 05:40:30,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-14 05:40:30,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-14 05:40:30,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-14 05:40:30,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-14 05:40:30,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-14 05:40:30,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:40:30,769 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:40:30,921 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 05:40:30,921 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 05:40:30,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:40:30 BasicIcfg [2024-11-14 05:40:30,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 05:40:30,926 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 05:40:30,926 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 05:40:30,927 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 05:40:30,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:39:48" (3/4) ... [2024-11-14 05:40:30,932 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 05:40:31,104 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 05:40:31,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 05:40:31,109 INFO L158 Benchmark]: Toolchain (without parser) took 44913.56ms. Allocated memory was 117.4MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 90.1MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-11-14 05:40:31,111 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:40:31,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.32ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 76.9MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 05:40:31,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.95ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:40:31,112 INFO L158 Benchmark]: Boogie Preprocessor took 89.30ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 05:40:31,113 INFO L158 Benchmark]: RCFGBuilder took 1703.44ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 33.2MB in the end (delta: 39.2MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-11-14 05:40:31,114 INFO L158 Benchmark]: TraceAbstraction took 42401.80ms. Allocated memory was 117.4MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 32.5MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-14 05:40:31,114 INFO L158 Benchmark]: Witness Printer took 182.17ms. Allocated memory is still 9.6GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 05:40:31,116 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory is still 39.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.32ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 76.9MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.95ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 89.30ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1703.44ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 33.2MB in the end (delta: 39.2MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 42401.80ms. Allocated memory was 117.4MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 32.5MB in the beginning and 7.6GB in the end (delta: -7.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 182.17ms. Allocated memory is still 9.6GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-4:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \old(size)=1, arr={-6:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, t1=-3, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0] [L71] 2 _Bool cond = j < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=0, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=0, q2_front=0, total=0] [L82] 2 q2_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L85] 2 cond = j < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, total=0] [L49] 1 _Bool cond = i < N; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-6:0}, i=0, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=0, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L59] 1 q1_back++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L114] COND TRUE 4 \read(cond) VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=0, total=0] [L116] CALL 4 assume_abort_if_not(q2_front < q2_back && q2_front >= 0 && q2_front < n2) [L38] COND FALSE 4 !(!cond) [L116] RET 4 assume_abort_if_not(q2_front < q2_back && q2_front >= 0 && q2_front < n2) [L117] EXPR 4 q2[q2_front] [L117] CALL, EXPR 4 plus(total, q2[q2_front]) [L172] CALL 4 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 4 !(!cond) [L172] RET 4 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 4 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 4 !(!cond) [L173] RET 4 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 4 return a + b; [L117] RET, EXPR 4 plus(total, q2[q2_front]) [L117] 4 total = plus(total, q2[q2_front]) [L118] 4 q2_front++ VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=1, total=-7] [L121] 4 cond = j < N || q2_front < q2_back VAL [N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=1, total=-7] [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=1, t1=-3, t2=-2, t3=-1, t4=0, total=-7] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-6:0}, i=1, j=1, n1=1, n2=1, q1={-4:0}, q1_back=1, q1_front=0, q2={-5:0}, q2_back=1, q2_front=1, t1=-3, t2=-2, t3=-1, t4=0, total=-7] - UnprovableResult [Line: 148]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 76 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 42.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.7s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1000 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1000 mSDsluCounter, 772 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1987 IncrementalHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 270 mSDtfsCounter, 1987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 169 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15562occurred in iteration=6, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 22282 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 653 ConstructedInterpolants, 0 QuantifiedInterpolants, 2323 SizeOfPredicates, 20 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 60/65 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 05:40:31,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d610aeff-2f41-43f3-a273-2009ba14dde8/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE